./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-array-index-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-array-index-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 4f65df5e606a8261702fe9d1f480f8ea4723a652ddeb9dc0601e1240905d046f
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-09 02:36:53,798 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 02:36:53,801 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-09 02:36:53,821 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-09 02:36:53,822 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-09 02:36:53,823 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-09 02:36:53,823 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-09 02:36:53,825 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-09 02:36:53,826 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-09 02:36:53,826 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-09 02:36:53,827 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-09 02:36:53,828 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-09 02:36:53,828 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-09 02:36:53,829 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-09 02:36:53,830 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-09 02:36:53,831 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-09 02:36:53,831 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-09 02:36:53,832 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-09 02:36:53,833 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-09 02:36:53,834 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-09 02:36:53,835 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-09 02:36:53,836 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-09 02:36:53,837 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-09 02:36:53,838 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-09 02:36:53,840 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-09 02:36:53,840 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-09 02:36:53,840 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-09 02:36:53,841 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-09 02:36:53,841 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-09 02:36:53,842 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-09 02:36:53,842 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-09 02:36:53,843 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-09 02:36:53,843 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-09 02:36:53,844 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-09 02:36:53,845 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-09 02:36:53,845 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-09 02:36:53,845 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-09 02:36:53,846 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-09 02:36:53,846 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-09 02:36:53,846 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-09 02:36:53,847 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-09 02:36:53,848 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 02:36:53,863 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-09 02:36:53,863 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 02:36:53,864 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 02:36:53,864 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 02:36:53,864 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 02:36:53,864 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 02:36:53,865 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 02:36:53,865 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 02:36:53,865 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-09 02:36:53,865 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 02:36:53,866 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-09 02:36:53,866 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-09 02:36:53,866 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 02:36:53,866 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 02:36:53,866 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 02:36:53,866 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 02:36:53,867 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 02:36:53,867 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 02:36:53,867 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 02:36:53,867 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-09 02:36:53,867 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 02:36:53,867 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-09 02:36:53,867 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 02:36:53,868 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 02:36:53,868 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 02:36:53,868 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 02:36:53,868 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 02:36:53,868 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 02:36:53,868 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 02:36:53,869 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-09 02:36:53,869 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 02:36:53,869 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 02:36:53,869 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 02:36:53,869 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 02:36:53,869 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 02:36:53,870 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 02:36:53,870 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-09 02:36:53,870 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 -> 4f65df5e606a8261702fe9d1f480f8ea4723a652ddeb9dc0601e1240905d046f
[2024-03-09 02:36:54,190 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 02:36:54,364 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 02:36:54,367 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 02:36:54,369 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-09 02:36:54,369 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-09 02:36:54,370 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2024-03-09 02:36:55,774 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 02:36:56,059 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-09 02:36:56,060 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-index-race.i
[2024-03-09 02:36:56,070 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/1d78b28bb/c6a99bec47b4496d9db9b5b79728ee86/FLAG1bdb1dd7d
[2024-03-09 02:36:56,081 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/1d78b28bb/c6a99bec47b4496d9db9b5b79728ee86
[2024-03-09 02:36:56,083 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 02:36:56,084 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 02:36:56,084 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 02:36:56,085 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 02:36:56,087 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 02:36:56,088 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,088 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d64819c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56, skipping insertion in model container
[2024-03-09 02:36:56,088 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,094 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-09 02:36:56,127 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-09 02:36:56,300 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 02:36:56,454 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 02:36:56,460 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-09 02:36:56,470 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 02:36:56,488 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 02:36:56,520 INFO  L208         MainTranslator]: Completed translation
[2024-03-09 02:36:56,521 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56 WrapperNode
[2024-03-09 02:36:56,521 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 02:36:56,522 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 02:36:56,522 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 02:36:56,522 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 02:36:56,526 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,545 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,562 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85
[2024-03-09 02:36:56,563 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 02:36:56,563 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 02:36:56,563 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 02:36:56,563 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 02:36:56,571 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,571 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,574 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,574 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,581 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,583 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,584 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,585 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,587 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 02:36:56,588 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 02:36:56,588 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 02:36:56,588 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-09 02:36:56,589 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (1/1) ...
[2024-03-09 02:36:56,595 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 02:36:56,604 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:36:56,628 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)
[2024-03-09 02:36:56,631 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
[2024-03-09 02:36:56,654 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 02:36:56,654 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 02:36:56,654 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 02:36:56,654 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 02:36:56,654 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 02:36:56,654 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 02:36:56,655 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 02:36:56,655 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 02:36:56,655 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 02:36:56,655 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 02:36:56,655 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 02:36:56,656 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-09 02:36:56,800 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-09 02:36:56,802 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 02:36:56,973 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-09 02:36:56,979 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 02:36:56,979 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 02:36:56,981 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 02:36:56 BoogieIcfgContainer
[2024-03-09 02:36:56,981 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 02:36:56,982 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 02:36:56,983 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 02:36:56,986 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-09 02:36:56,986 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:36:56" (1/3) ...
[2024-03-09 02:36:56,987 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ec8949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:36:56, skipping insertion in model container
[2024-03-09 02:36:56,987 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:36:56" (2/3) ...
[2024-03-09 02:36:56,987 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ec8949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:36:56, skipping insertion in model container
[2024-03-09 02:36:56,987 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 02:36:56" (3/3) ...
[2024-03-09 02:36:56,988 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i
[2024-03-09 02:36:56,995 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 02:36:57,003 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 02:36:57,004 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-03-09 02:36:57,004 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 02:36:57,066 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 02:36:57,113 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2024-03-09 02:36:57,166 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2024-03-09 02:36:57,166 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 02:36:57,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 338 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2024-03-09 02:36:57,171 INFO  L82        GeneralOperation]: Start removeDead. Operand has 115 places, 116 transitions, 240 flow
[2024-03-09 02:36:57,175 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 115 places, 116 transitions, 240 flow
[2024-03-09 02:36:57,179 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-09 02:36:57,186 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 116 transitions, 240 flow
[2024-03-09 02:36:57,188 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 116 transitions, 240 flow
[2024-03-09 02:36:57,189 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 115 places, 116 transitions, 240 flow
[2024-03-09 02:36:57,218 INFO  L130       PetriNetUnfolder]: 6/166 cut-off events.
[2024-03-09 02:36:57,218 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 02:36:57,219 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172 conditions, 166 events. 6/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 338 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. 
[2024-03-09 02:36:57,221 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2166
[2024-03-09 02:36:59,411 INFO  L134        LiptonReduction]: Checked pairs total: 12504
[2024-03-09 02:36:59,411 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2024-03-09 02:36:59,424 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 02:36:59,430 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;@1f3e1c8f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-09 02:36:59,430 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-03-09 02:36:59,432 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2024-03-09 02:36:59,432 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-09 02:36:59,432 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:36:59,433 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-09 02:36:59,433 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:36:59,436 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:36:59,437 INFO  L85        PathProgramCache]: Analyzing trace with hash 384, now seen corresponding path program 1 times
[2024-03-09 02:36:59,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:36:59,444 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594306703]
[2024-03-09 02:36:59,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:36:59,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:36:59,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:36:59,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:36:59,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:36:59,529 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594306703]
[2024-03-09 02:36:59,530 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594306703] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:36:59,530 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:36:59,530 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-09 02:36:59,531 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302418547]
[2024-03-09 02:36:59,532 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:36:59,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-09 02:36:59,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:36:59,553 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-09 02:36:59,554 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-09 02:36:59,555 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 194
[2024-03-09 02:36:59,557 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 108 flow. Second operand  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:36:59,557 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:36:59,557 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 194
[2024-03-09 02:36:59,558 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:36:59,607 INFO  L130       PetriNetUnfolder]: 33/213 cut-off events.
[2024-03-09 02:36:59,608 INFO  L131       PetriNetUnfolder]: For 7/10 co-relation queries the response was YES.
[2024-03-09 02:36:59,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 308 conditions, 213 events. 33/213 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1010 event pairs, 32 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 250. Up to 88 conditions per place. 
[2024-03-09 02:36:59,610 INFO  L137   encePairwiseOnDemand]: 193/194 looper letters, 16 selfloop transitions, 0 changer transitions 0/49 dead transitions.
[2024-03-09 02:36:59,610 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 138 flow
[2024-03-09 02:36:59,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-09 02:36:59,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-09 02:36:59,618 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions.
[2024-03-09 02:36:59,620 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.615979381443299
[2024-03-09 02:36:59,621 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 239 transitions.
[2024-03-09 02:36:59,621 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 239 transitions.
[2024-03-09 02:36:59,622 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:36:59,624 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 239 transitions.
[2024-03-09 02:36:59,626 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 119.5) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:36:59,630 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:36:59,631 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:36:59,632 INFO  L175             Difference]: Start difference. First operand has 52 places, 50 transitions, 108 flow. Second operand 2 states and 239 transitions.
[2024-03-09 02:36:59,633 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 138 flow
[2024-03-09 02:36:59,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 49 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:36:59,636 INFO  L231             Difference]: Finished difference. Result has 52 places, 49 transitions, 106 flow
[2024-03-09 02:36:59,637 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=52, PETRI_TRANSITIONS=49}
[2024-03-09 02:36:59,640 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places.
[2024-03-09 02:36:59,640 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 106 flow
[2024-03-09 02:36:59,640 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:36:59,640 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:36:59,641 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:36:59,641 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 02:36:59,641 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:36:59,641 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:36:59,641 INFO  L85        PathProgramCache]: Analyzing trace with hash 1913299805, now seen corresponding path program 1 times
[2024-03-09 02:36:59,642 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:36:59,642 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910469957]
[2024-03-09 02:36:59,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:36:59,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:36:59,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:36:59,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:36:59,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:36:59,956 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910469957]
[2024-03-09 02:36:59,956 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910469957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:36:59,957 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:36:59,957 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:36:59,957 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160578968]
[2024-03-09 02:36:59,957 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:36:59,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:36:59,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:36:59,958 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:36:59,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:37:00,119 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 194
[2024-03-09 02:37:00,120 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 106 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:00,120 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:00,120 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 194
[2024-03-09 02:37:00,121 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:00,300 INFO  L130       PetriNetUnfolder]: 245/703 cut-off events.
[2024-03-09 02:37:00,300 INFO  L131       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2024-03-09 02:37:00,302 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1300 conditions, 703 events. 245/703 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4013 event pairs, 86 based on Foata normal form. 1/658 useless extension candidates. Maximal degree in co-relation 1296. Up to 291 conditions per place. 
[2024-03-09 02:37:00,305 INFO  L137   encePairwiseOnDemand]: 171/194 looper letters, 61 selfloop transitions, 29 changer transitions 0/102 dead transitions.
[2024-03-09 02:37:00,305 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 395 flow
[2024-03-09 02:37:00,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:37:00,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:37:00,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 609 transitions.
[2024-03-09 02:37:00,308 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5231958762886598
[2024-03-09 02:37:00,309 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 609 transitions.
[2024-03-09 02:37:00,309 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 609 transitions.
[2024-03-09 02:37:00,310 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:00,310 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 609 transitions.
[2024-03-09 02:37:00,312 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:00,315 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:00,316 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:00,316 INFO  L175             Difference]: Start difference. First operand has 52 places, 49 transitions, 106 flow. Second operand 6 states and 609 transitions.
[2024-03-09 02:37:00,316 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 395 flow
[2024-03-09 02:37:00,317 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:00,319 INFO  L231             Difference]: Finished difference. Result has 62 places, 78 transitions, 326 flow
[2024-03-09 02:37:00,319 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=62, PETRI_TRANSITIONS=78}
[2024-03-09 02:37:00,319 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2024-03-09 02:37:00,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 78 transitions, 326 flow
[2024-03-09 02:37:00,320 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:00,320 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:00,320 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:37:00,320 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 02:37:00,320 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:37:00,321 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:00,321 INFO  L85        PathProgramCache]: Analyzing trace with hash 109715366, now seen corresponding path program 1 times
[2024-03-09 02:37:00,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:00,321 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358860719]
[2024-03-09 02:37:00,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:00,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:00,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:00,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:00,348 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:00,348 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358860719]
[2024-03-09 02:37:00,348 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358860719] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:00,348 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:37:00,348 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 02:37:00,348 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396620778]
[2024-03-09 02:37:00,348 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:00,349 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 02:37:00,349 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:00,349 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 02:37:00,349 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 02:37:00,360 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 194
[2024-03-09 02:37:00,361 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 78 transitions, 326 flow. Second operand  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:00,361 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:00,361 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 194
[2024-03-09 02:37:00,361 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:00,430 INFO  L130       PetriNetUnfolder]: 122/485 cut-off events.
[2024-03-09 02:37:00,430 INFO  L131       PetriNetUnfolder]: For 113/118 co-relation queries the response was YES.
[2024-03-09 02:37:00,432 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 485 events. 122/485 cut-off events. For 113/118 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2716 event pairs, 10 based on Foata normal form. 11/468 useless extension candidates. Maximal degree in co-relation 1076. Up to 129 conditions per place. 
[2024-03-09 02:37:00,433 INFO  L137   encePairwiseOnDemand]: 190/194 looper letters, 24 selfloop transitions, 2 changer transitions 0/84 dead transitions.
[2024-03-09 02:37:00,433 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 392 flow
[2024-03-09 02:37:00,434 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 02:37:00,434 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 02:37:00,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions.
[2024-03-09 02:37:00,435 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5807560137457045
[2024-03-09 02:37:00,435 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 338 transitions.
[2024-03-09 02:37:00,435 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 338 transitions.
[2024-03-09 02:37:00,435 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:00,435 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 338 transitions.
[2024-03-09 02:37:00,436 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:00,437 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:00,438 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:00,438 INFO  L175             Difference]: Start difference. First operand has 62 places, 78 transitions, 326 flow. Second operand 3 states and 338 transitions.
[2024-03-09 02:37:00,438 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 392 flow
[2024-03-09 02:37:00,441 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 84 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:00,442 INFO  L231             Difference]: Finished difference. Result has 63 places, 78 transitions, 336 flow
[2024-03-09 02:37:00,442 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=78}
[2024-03-09 02:37:00,442 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2024-03-09 02:37:00,442 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 336 flow
[2024-03-09 02:37:00,443 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:00,443 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:00,443 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:37:00,443 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 02:37:00,443 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:37:00,443 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:00,444 INFO  L85        PathProgramCache]: Analyzing trace with hash 377180626, now seen corresponding path program 1 times
[2024-03-09 02:37:00,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:00,444 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416704464]
[2024-03-09 02:37:00,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:00,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:00,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:00,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:00,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:00,639 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416704464]
[2024-03-09 02:37:00,640 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416704464] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:00,640 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:37:00,641 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:37:00,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647750123]
[2024-03-09 02:37:00,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:00,642 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:37:00,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:00,643 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:37:00,643 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:37:00,878 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 194
[2024-03-09 02:37:00,879 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 336 flow. Second operand  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:00,879 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:00,879 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 194
[2024-03-09 02:37:00,879 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:01,043 INFO  L130       PetriNetUnfolder]: 228/665 cut-off events.
[2024-03-09 02:37:01,043 INFO  L131       PetriNetUnfolder]: For 293/299 co-relation queries the response was YES.
[2024-03-09 02:37:01,044 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1726 conditions, 665 events. 228/665 cut-off events. For 293/299 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3546 event pairs, 57 based on Foata normal form. 0/627 useless extension candidates. Maximal degree in co-relation 1716. Up to 360 conditions per place. 
[2024-03-09 02:37:01,046 INFO  L137   encePairwiseOnDemand]: 183/194 looper letters, 52 selfloop transitions, 33 changer transitions 8/128 dead transitions.
[2024-03-09 02:37:01,046 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 128 transitions, 725 flow
[2024-03-09 02:37:01,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:37:01,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:37:01,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-09 02:37:01,050 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5506872852233677
[2024-03-09 02:37:01,050 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-09 02:37:01,050 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-09 02:37:01,051 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:01,051 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-09 02:37:01,053 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:01,056 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:01,057 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:01,057 INFO  L175             Difference]: Start difference. First operand has 63 places, 78 transitions, 336 flow. Second operand 6 states and 641 transitions.
[2024-03-09 02:37:01,058 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 128 transitions, 725 flow
[2024-03-09 02:37:01,061 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:01,063 INFO  L231             Difference]: Finished difference. Result has 73 places, 108 transitions, 637 flow
[2024-03-09 02:37:01,063 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=637, PETRI_PLACES=73, PETRI_TRANSITIONS=108}
[2024-03-09 02:37:01,063 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places.
[2024-03-09 02:37:01,064 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 108 transitions, 637 flow
[2024-03-09 02:37:01,064 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:01,064 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:01,064 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:37:01,064 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 02:37:01,064 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:37:01,065 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:01,065 INFO  L85        PathProgramCache]: Analyzing trace with hash -55836617, now seen corresponding path program 1 times
[2024-03-09 02:37:01,065 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:01,065 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263436410]
[2024-03-09 02:37:01,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:01,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:01,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:01,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:01,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:01,279 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263436410]
[2024-03-09 02:37:01,279 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263436410] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:01,279 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:37:01,279 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:37:01,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107242730]
[2024-03-09 02:37:01,279 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:01,279 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:37:01,280 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:01,280 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:37:01,280 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:37:01,396 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 194
[2024-03-09 02:37:01,396 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 108 transitions, 637 flow. Second operand  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:01,397 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:01,397 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 194
[2024-03-09 02:37:01,397 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:01,739 INFO  L130       PetriNetUnfolder]: 402/1014 cut-off events.
[2024-03-09 02:37:01,739 INFO  L131       PetriNetUnfolder]: For 764/772 co-relation queries the response was YES.
[2024-03-09 02:37:01,742 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 1014 events. 402/1014 cut-off events. For 764/772 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6004 event pairs, 103 based on Foata normal form. 0/949 useless extension candidates. Maximal degree in co-relation 3282. Up to 729 conditions per place. 
[2024-03-09 02:37:01,746 INFO  L137   encePairwiseOnDemand]: 172/194 looper letters, 105 selfloop transitions, 76 changer transitions 24/218 dead transitions.
[2024-03-09 02:37:01,746 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 218 transitions, 1523 flow
[2024-03-09 02:37:01,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:37:01,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:37:01,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions.
[2024-03-09 02:37:01,748 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5446735395189003
[2024-03-09 02:37:01,748 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 634 transitions.
[2024-03-09 02:37:01,748 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions.
[2024-03-09 02:37:01,748 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:01,748 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions.
[2024-03-09 02:37:01,750 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:01,751 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:01,751 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:01,752 INFO  L175             Difference]: Start difference. First operand has 73 places, 108 transitions, 637 flow. Second operand 6 states and 634 transitions.
[2024-03-09 02:37:01,752 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 218 transitions, 1523 flow
[2024-03-09 02:37:01,756 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 218 transitions, 1523 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:01,759 INFO  L231             Difference]: Finished difference. Result has 81 places, 174 transitions, 1228 flow
[2024-03-09 02:37:01,759 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=81, PETRI_TRANSITIONS=174}
[2024-03-09 02:37:01,760 INFO  L288   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2024-03-09 02:37:01,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 174 transitions, 1228 flow
[2024-03-09 02:37:01,760 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:01,760 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:01,760 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-09 02:37:01,760 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 02:37:01,760 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-03-09 02:37:01,761 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:01,761 INFO  L85        PathProgramCache]: Analyzing trace with hash 1003106096, now seen corresponding path program 1 times
[2024-03-09 02:37:01,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:01,761 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112639242]
[2024-03-09 02:37:01,761 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:01,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:01,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 02:37:01,783 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 02:37:01,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 02:37:01,808 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 02:37:01,809 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 02:37:01,809 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-03-09 02:37:01,810 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-03-09 02:37:01,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-03-09 02:37:01,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-03-09 02:37:01,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-03-09 02:37:01,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-03-09 02:37:01,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-03-09 02:37:01,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-03-09 02:37:01,811 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-03-09 02:37:01,812 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-03-09 02:37:01,812 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-03-09 02:37:01,812 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 02:37:01,812 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-03-09 02:37:01,814 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 02:37:01,814 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 02:37:01,830 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 02:37:01,832 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2024-03-09 02:37:01,856 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2024-03-09 02:37:01,856 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-09 02:37:01,857 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 725 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2024-03-09 02:37:01,857 INFO  L82        GeneralOperation]: Start removeDead. Operand has 137 places, 137 transitions, 292 flow
[2024-03-09 02:37:01,858 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 137 places, 137 transitions, 292 flow
[2024-03-09 02:37:01,858 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-09 02:37:01,858 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 137 transitions, 292 flow
[2024-03-09 02:37:01,859 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 137 transitions, 292 flow
[2024-03-09 02:37:01,859 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 292 flow
[2024-03-09 02:37:01,875 INFO  L130       PetriNetUnfolder]: 11/291 cut-off events.
[2024-03-09 02:37:01,875 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-09 02:37:01,876 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 305 conditions, 291 events. 11/291 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 725 event pairs, 0 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. 
[2024-03-09 02:37:01,879 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5548
[2024-03-09 02:37:03,858 INFO  L134        LiptonReduction]: Checked pairs total: 27446
[2024-03-09 02:37:03,858 INFO  L136        LiptonReduction]: Total number of compositions: 83
[2024-03-09 02:37:03,860 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 02:37:03,861 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;@1f3e1c8f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-09 02:37:03,861 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2024-03-09 02:37:03,861 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-03-09 02:37:03,861 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-09 02:37:03,861 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:03,861 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-09 02:37:03,861 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:03,862 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:03,862 INFO  L85        PathProgramCache]: Analyzing trace with hash 624, now seen corresponding path program 1 times
[2024-03-09 02:37:03,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:03,862 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135931885]
[2024-03-09 02:37:03,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:03,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:03,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:03,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:03,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:03,866 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135931885]
[2024-03-09 02:37:03,866 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135931885] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:03,866 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:37:03,867 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-09 02:37:03,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312233319]
[2024-03-09 02:37:03,867 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:03,867 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-09 02:37:03,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:03,867 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-09 02:37:03,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-09 02:37:03,868 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 220
[2024-03-09 02:37:03,868 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 146 flow. Second operand  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:03,868 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:03,868 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 220
[2024-03-09 02:37:03,868 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:03,996 INFO  L130       PetriNetUnfolder]: 411/1257 cut-off events.
[2024-03-09 02:37:03,997 INFO  L131       PetriNetUnfolder]: For 71/158 co-relation queries the response was YES.
[2024-03-09 02:37:03,998 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1257 events. 411/1257 cut-off events. For 71/158 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8130 event pairs, 404 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1664. Up to 731 conditions per place. 
[2024-03-09 02:37:04,001 INFO  L137   encePairwiseOnDemand]: 219/220 looper letters, 22 selfloop transitions, 0 changer transitions 0/63 dead transitions.
[2024-03-09 02:37:04,001 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 188 flow
[2024-03-09 02:37:04,002 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-09 02:37:04,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-09 02:37:04,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 283 transitions.
[2024-03-09 02:37:04,003 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6431818181818182
[2024-03-09 02:37:04,003 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 283 transitions.
[2024-03-09 02:37:04,003 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 283 transitions.
[2024-03-09 02:37:04,003 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:04,003 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 283 transitions.
[2024-03-09 02:37:04,004 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 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)
[2024-03-09 02:37:04,005 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:04,005 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:04,005 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 146 flow. Second operand 2 states and 283 transitions.
[2024-03-09 02:37:04,005 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 188 flow
[2024-03-09 02:37:04,005 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:04,006 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 144 flow
[2024-03-09 02:37:04,006 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2024-03-09 02:37:04,007 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places.
[2024-03-09 02:37:04,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 144 flow
[2024-03-09 02:37:04,007 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:04,007 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:04,007 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:37:04,007 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 02:37:04,007 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:04,007 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:04,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 455692181, now seen corresponding path program 1 times
[2024-03-09 02:37:04,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:04,008 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241177120]
[2024-03-09 02:37:04,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:04,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:04,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:04,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:04,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:04,126 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241177120]
[2024-03-09 02:37:04,126 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241177120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:04,126 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:37:04,126 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:37:04,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119469362]
[2024-03-09 02:37:04,127 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:04,127 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:37:04,127 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:04,127 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:37:04,127 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:37:04,276 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 220
[2024-03-09 02:37:04,277 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 144 flow. Second operand  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:04,277 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:04,277 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 220
[2024-03-09 02:37:04,277 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:05,222 INFO  L130       PetriNetUnfolder]: 5742/10965 cut-off events.
[2024-03-09 02:37:05,223 INFO  L131       PetriNetUnfolder]: For 239/274 co-relation queries the response was YES.
[2024-03-09 02:37:05,230 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20646 conditions, 10965 events. 5742/10965 cut-off events. For 239/274 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 81992 event pairs, 1527 based on Foata normal form. 16/10302 useless extension candidates. Maximal degree in co-relation 20641. Up to 5895 conditions per place. 
[2024-03-09 02:37:05,262 INFO  L137   encePairwiseOnDemand]: 193/220 looper letters, 93 selfloop transitions, 48 changer transitions 0/158 dead transitions.
[2024-03-09 02:37:05,263 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 158 transitions, 627 flow
[2024-03-09 02:37:05,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:37:05,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:37:05,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions.
[2024-03-09 02:37:05,265 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5681818181818182
[2024-03-09 02:37:05,265 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 750 transitions.
[2024-03-09 02:37:05,265 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions.
[2024-03-09 02:37:05,266 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:05,266 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions.
[2024-03-09 02:37:05,267 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:05,269 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:05,269 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:05,269 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 144 flow. Second operand 6 states and 750 transitions.
[2024-03-09 02:37:05,269 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 158 transitions, 627 flow
[2024-03-09 02:37:05,270 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 158 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:05,272 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 486 flow
[2024-03-09 02:37:05,272 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2024-03-09 02:37:05,272 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2024-03-09 02:37:05,272 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 486 flow
[2024-03-09 02:37:05,273 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:05,273 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:05,273 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:37:05,273 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 02:37:05,273 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:05,273 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:05,273 INFO  L85        PathProgramCache]: Analyzing trace with hash 1684042827, now seen corresponding path program 1 times
[2024-03-09 02:37:05,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:05,273 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840291308]
[2024-03-09 02:37:05,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:05,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:05,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:05,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:05,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:05,292 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840291308]
[2024-03-09 02:37:05,292 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840291308] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:05,292 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:37:05,292 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 02:37:05,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117772588]
[2024-03-09 02:37:05,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:05,293 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 02:37:05,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:05,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 02:37:05,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 02:37:05,308 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 220
[2024-03-09 02:37:05,308 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 486 flow. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:05,308 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:05,308 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 220
[2024-03-09 02:37:05,308 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:05,728 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([575] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_69| v_~datas~0.base_71)) (.cse1 (* v_threadThread1of2ForFork0_~i~0_37 4))) (and (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_63))) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_63 1))) (= |v_threadThread1of2ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_63))) (= |v_threadThread1of2ForFork0_#res.offset_9| 0) (= (select .cse0 (+ .cse1 3 v_~datas~0.offset_63)) |v_threadThread1of2ForFork0_#t~nondet4_28|) (= |v_threadThread1of2ForFork0_#res.base_9| 0)))  InVars {#race=|v_#race_69|, ~datas~0.base=v_~datas~0.base_71, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_28|, ~datas~0.offset=v_~datas~0.offset_63}  OutVars{#race=|v_#race_69|, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_9|, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_9|, threadThread1of2ForFork0_#t~nondet3=|v_threadThread1of2ForFork0_#t~nondet3_15|, ~datas~0.base=v_~datas~0.base_71, threadThread1of2ForFork0_~i~0=v_threadThread1of2ForFork0_~i~0_37, ~datas~0.offset=v_~datas~0.offset_63}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_#t~nondet3, threadThread1of2ForFork0_#t~nondet4][58], [140#true, 20#L1016-4true, 143#true, 2#ULTIMATE.startEXITtrue, Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 157#(= |#race~datas~0| 0), threadThread1of2ForFork0InUse, Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 46#threadEXITtrue, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse])
[2024-03-09 02:37:05,728 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-03-09 02:37:05,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-09 02:37:05,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-09 02:37:05,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-09 02:37:05,729 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L1016-4-->L1016-6: Formula: (= (store |v_#race_60| v_~datas~0.base_57 (store (select |v_#race_60| v_~datas~0.base_57) (+ v_~datas~0.offset_51 (* v_threadThread2of2ForFork0_~i~0_23 4)) |v_threadThread2of2ForFork0_#t~nondet4_21|)) |v_#race_59|)  InVars {#race=|v_#race_60|, ~datas~0.base=v_~datas~0.base_57, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_23}  OutVars{#race=|v_#race_59|, ~datas~0.base=v_~datas~0.base_57, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_21|, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][91], [140#true, 2#ULTIMATE.startEXITtrue, 143#true, Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 63#L1016-9true, 157#(= |#race~datas~0| 0), Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 125#L1016-6true])
[2024-03-09 02:37:05,729 INFO  L383   tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event
[2024-03-09 02:37:05,729 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-09 02:37:05,729 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-09 02:37:05,729 INFO  L386   tUnfolder$Statistics]:   existing Event has 41 ancestors and is cut-off event
[2024-03-09 02:37:05,849 INFO  L130       PetriNetUnfolder]: 2751/6464 cut-off events.
[2024-03-09 02:37:05,850 INFO  L131       PetriNetUnfolder]: For 2099/2651 co-relation queries the response was YES.
[2024-03-09 02:37:05,859 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14862 conditions, 6464 events. 2751/6464 cut-off events. For 2099/2651 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53226 event pairs, 926 based on Foata normal form. 125/6165 useless extension candidates. Maximal degree in co-relation 14852. Up to 2371 conditions per place. 
[2024-03-09 02:37:05,876 INFO  L137   encePairwiseOnDemand]: 214/220 looper letters, 36 selfloop transitions, 3 changer transitions 0/118 dead transitions.
[2024-03-09 02:37:05,876 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 118 transitions, 585 flow
[2024-03-09 02:37:05,877 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 02:37:05,877 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 02:37:05,878 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions.
[2024-03-09 02:37:05,878 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6
[2024-03-09 02:37:05,878 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 396 transitions.
[2024-03-09 02:37:05,878 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions.
[2024-03-09 02:37:05,878 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:05,878 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions.
[2024-03-09 02:37:05,879 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:05,880 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:05,880 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:05,881 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 486 flow. Second operand 3 states and 396 transitions.
[2024-03-09 02:37:05,881 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 118 transitions, 585 flow
[2024-03-09 02:37:05,890 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:05,891 INFO  L231             Difference]: Finished difference. Result has 77 places, 111 transitions, 501 flow
[2024-03-09 02:37:05,891 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=77, PETRI_TRANSITIONS=111}
[2024-03-09 02:37:05,892 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 10 predicate places.
[2024-03-09 02:37:05,892 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 501 flow
[2024-03-09 02:37:05,892 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:05,892 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:05,892 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:37:05,892 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 02:37:05,892 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:05,893 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:05,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 546192249, now seen corresponding path program 1 times
[2024-03-09 02:37:05,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:05,893 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688815866]
[2024-03-09 02:37:05,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:05,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:05,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:06,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:06,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:06,031 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688815866]
[2024-03-09 02:37:06,031 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688815866] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:06,031 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:37:06,031 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:37:06,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083770715]
[2024-03-09 02:37:06,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:06,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:37:06,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:06,032 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:37:06,032 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:37:06,230 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 220
[2024-03-09 02:37:06,231 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 501 flow. Second operand  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:06,231 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:06,231 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 220
[2024-03-09 02:37:06,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:07,201 INFO  L130       PetriNetUnfolder]: 5675/10752 cut-off events.
[2024-03-09 02:37:07,201 INFO  L131       PetriNetUnfolder]: For 6547/6645 co-relation queries the response was YES.
[2024-03-09 02:37:07,215 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28674 conditions, 10752 events. 5675/10752 cut-off events. For 6547/6645 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 79188 event pairs, 1877 based on Foata normal form. 0/10233 useless extension candidates. Maximal degree in co-relation 28663. Up to 6983 conditions per place. 
[2024-03-09 02:37:07,241 INFO  L137   encePairwiseOnDemand]: 205/220 looper letters, 110 selfloop transitions, 70 changer transitions 0/218 dead transitions.
[2024-03-09 02:37:07,241 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 218 transitions, 1313 flow
[2024-03-09 02:37:07,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:37:07,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:37:07,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions.
[2024-03-09 02:37:07,244 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2024-03-09 02:37:07,244 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 770 transitions.
[2024-03-09 02:37:07,244 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions.
[2024-03-09 02:37:07,244 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:07,244 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions.
[2024-03-09 02:37:07,246 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:07,247 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:07,247 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:07,247 INFO  L175             Difference]: Start difference. First operand has 77 places, 111 transitions, 501 flow. Second operand 6 states and 770 transitions.
[2024-03-09 02:37:07,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 218 transitions, 1313 flow
[2024-03-09 02:37:07,255 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 1313 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:07,258 INFO  L231             Difference]: Finished difference. Result has 87 places, 180 transitions, 1155 flow
[2024-03-09 02:37:07,258 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1155, PETRI_PLACES=87, PETRI_TRANSITIONS=180}
[2024-03-09 02:37:07,258 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 20 predicate places.
[2024-03-09 02:37:07,258 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 180 transitions, 1155 flow
[2024-03-09 02:37:07,259 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:07,259 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:07,259 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:37:07,259 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 02:37:07,259 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:07,259 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:07,259 INFO  L85        PathProgramCache]: Analyzing trace with hash -1368584717, now seen corresponding path program 1 times
[2024-03-09 02:37:07,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:07,259 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613037229]
[2024-03-09 02:37:07,260 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:07,260 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:07,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:07,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:07,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:07,444 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613037229]
[2024-03-09 02:37:07,444 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613037229] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:07,444 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:37:07,444 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:37:07,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038534906]
[2024-03-09 02:37:07,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:07,445 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:37:07,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:07,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:37:07,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:37:07,588 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 220
[2024-03-09 02:37:07,589 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 180 transitions, 1155 flow. Second operand  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:07,589 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:07,590 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 220
[2024-03-09 02:37:07,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:09,796 INFO  L130       PetriNetUnfolder]: 11355/20109 cut-off events.
[2024-03-09 02:37:09,796 INFO  L131       PetriNetUnfolder]: For 18621/18782 co-relation queries the response was YES.
[2024-03-09 02:37:09,827 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64116 conditions, 20109 events. 11355/20109 cut-off events. For 18621/18782 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 151317 event pairs, 3272 based on Foata normal form. 0/18814 useless extension candidates. Maximal degree in co-relation 64100. Up to 13848 conditions per place. 
[2024-03-09 02:37:09,879 INFO  L137   encePairwiseOnDemand]: 194/220 looper letters, 239 selfloop transitions, 132 changer transitions 0/389 dead transitions.
[2024-03-09 02:37:09,879 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 389 transitions, 2939 flow
[2024-03-09 02:37:09,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:37:09,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:37:09,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 784 transitions.
[2024-03-09 02:37:09,882 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.593939393939394
[2024-03-09 02:37:09,882 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 784 transitions.
[2024-03-09 02:37:09,882 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 784 transitions.
[2024-03-09 02:37:09,883 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:09,883 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 784 transitions.
[2024-03-09 02:37:09,884 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 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)
[2024-03-09 02:37:09,885 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:09,886 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:09,886 INFO  L175             Difference]: Start difference. First operand has 87 places, 180 transitions, 1155 flow. Second operand 6 states and 784 transitions.
[2024-03-09 02:37:09,886 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 389 transitions, 2939 flow
[2024-03-09 02:37:09,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 389 transitions, 2939 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:09,919 INFO  L231             Difference]: Finished difference. Result has 96 places, 302 transitions, 2326 flow
[2024-03-09 02:37:09,919 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2326, PETRI_PLACES=96, PETRI_TRANSITIONS=302}
[2024-03-09 02:37:09,920 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 29 predicate places.
[2024-03-09 02:37:09,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 302 transitions, 2326 flow
[2024-03-09 02:37:09,920 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:09,920 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:09,920 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:37:09,921 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 02:37:09,921 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:09,921 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:09,921 INFO  L85        PathProgramCache]: Analyzing trace with hash -1735763816, now seen corresponding path program 1 times
[2024-03-09 02:37:09,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:09,921 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379183500]
[2024-03-09 02:37:09,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:09,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:09,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:10,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-09 02:37:10,170 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:10,170 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379183500]
[2024-03-09 02:37:10,170 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379183500] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:37:10,171 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142901717]
[2024-03-09 02:37:10,171 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:10,171 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:37:10,171 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:37:10,176 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:37:10,182 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 02:37:10,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:10,287 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2024-03-09 02:37:10,292 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:37:10,419 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
[2024-03-09 02:37:10,446 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:10,447 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 21 treesize of output 20
[2024-03-09 02:37:10,477 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:10,478 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:10,479 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 02:37:10,528 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:10,529 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:10,530 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:10,531 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 02:37:10,581 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:10,582 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
[2024-03-09 02:37:10,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-09 02:37:10,609 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 02:37:10,644 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-09 02:37:10,667 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2024-03-09 02:37:10,691 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_318) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2024-03-09 02:37:10,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked.
[2024-03-09 02:37:10,773 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [142901717] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 02:37:10,773 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 02:37:10,773 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15
[2024-03-09 02:37:10,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511789855]
[2024-03-09 02:37:10,774 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 02:37:10,774 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-03-09 02:37:10,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:10,774 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-03-09 02:37:10,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=121, Unknown=3, NotChecked=78, Total=272
[2024-03-09 02:37:10,885 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 81 out of 220
[2024-03-09 02:37:10,887 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 302 transitions, 2326 flow. Second operand  has 17 states, 17 states have (on average 83.3529411764706) internal successors, (1417), 17 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:10,887 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:10,887 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 220
[2024-03-09 02:37:10,887 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:13,730 INFO  L130       PetriNetUnfolder]: 13999/23442 cut-off events.
[2024-03-09 02:37:13,730 INFO  L131       PetriNetUnfolder]: For 44014/44014 co-relation queries the response was YES.
[2024-03-09 02:37:13,789 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 90855 conditions, 23442 events. 13999/23442 cut-off events. For 44014/44014 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 166306 event pairs, 5754 based on Foata normal form. 498/22445 useless extension candidates. Maximal degree in co-relation 90834. Up to 21949 conditions per place. 
[2024-03-09 02:37:13,874 INFO  L137   encePairwiseOnDemand]: 203/220 looper letters, 325 selfloop transitions, 7 changer transitions 11/350 dead transitions.
[2024-03-09 02:37:13,875 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 350 transitions, 3333 flow
[2024-03-09 02:37:13,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-09 02:37:13,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-09 02:37:13,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 654 transitions.
[2024-03-09 02:37:13,878 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.42467532467532465
[2024-03-09 02:37:13,878 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 654 transitions.
[2024-03-09 02:37:13,878 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 654 transitions.
[2024-03-09 02:37:13,878 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:13,878 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 654 transitions.
[2024-03-09 02:37:13,880 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:13,881 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:13,882 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:13,882 INFO  L175             Difference]: Start difference. First operand has 96 places, 302 transitions, 2326 flow. Second operand 7 states and 654 transitions.
[2024-03-09 02:37:13,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 350 transitions, 3333 flow
[2024-03-09 02:37:14,205 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 350 transitions, 3237 flow, removed 48 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:14,209 INFO  L231             Difference]: Finished difference. Result has 103 places, 303 transitions, 2290 flow
[2024-03-09 02:37:14,209 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=2218, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2290, PETRI_PLACES=103, PETRI_TRANSITIONS=303}
[2024-03-09 02:37:14,210 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 36 predicate places.
[2024-03-09 02:37:14,210 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 303 transitions, 2290 flow
[2024-03-09 02:37:14,210 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 83.3529411764706) internal successors, (1417), 17 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:14,210 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:14,211 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:37:14,219 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 02:37:14,411 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-03-09 02:37:14,412 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:14,412 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:14,413 INFO  L85        PathProgramCache]: Analyzing trace with hash -2081569429, now seen corresponding path program 1 times
[2024-03-09 02:37:14,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:14,414 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740227542]
[2024-03-09 02:37:14,414 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:14,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:14,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:14,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 02:37:14,729 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:14,729 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740227542]
[2024-03-09 02:37:14,729 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740227542] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:14,729 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:37:14,730 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-03-09 02:37:14,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854499258]
[2024-03-09 02:37:14,730 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:14,731 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-09 02:37:14,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:14,731 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-09 02:37:14,731 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-03-09 02:37:14,976 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 220
[2024-03-09 02:37:14,977 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 303 transitions, 2290 flow. Second operand  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:14,977 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:14,977 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 220
[2024-03-09 02:37:14,977 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:18,223 INFO  L130       PetriNetUnfolder]: 13786/24057 cut-off events.
[2024-03-09 02:37:18,223 INFO  L131       PetriNetUnfolder]: For 44038/44107 co-relation queries the response was YES.
[2024-03-09 02:37:18,292 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95209 conditions, 24057 events. 13786/24057 cut-off events. For 44038/44107 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 184197 event pairs, 3653 based on Foata normal form. 354/23937 useless extension candidates. Maximal degree in co-relation 95183. Up to 11376 conditions per place. 
[2024-03-09 02:37:18,362 INFO  L137   encePairwiseOnDemand]: 204/220 looper letters, 454 selfloop transitions, 166 changer transitions 1/636 dead transitions.
[2024-03-09 02:37:18,363 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 636 transitions, 5725 flow
[2024-03-09 02:37:18,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-09 02:37:18,363 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-09 02:37:18,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 981 transitions.
[2024-03-09 02:37:18,366 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5573863636363636
[2024-03-09 02:37:18,366 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 981 transitions.
[2024-03-09 02:37:18,366 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 981 transitions.
[2024-03-09 02:37:18,366 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:18,366 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 981 transitions.
[2024-03-09 02:37:18,368 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 122.625) internal successors, (981), 8 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:18,369 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:18,370 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:18,370 INFO  L175             Difference]: Start difference. First operand has 103 places, 303 transitions, 2290 flow. Second operand 8 states and 981 transitions.
[2024-03-09 02:37:18,370 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 636 transitions, 5725 flow
[2024-03-09 02:37:18,674 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 636 transitions, 5641 flow, removed 31 selfloop flow, removed 2 redundant places.
[2024-03-09 02:37:18,680 INFO  L231             Difference]: Finished difference. Result has 114 places, 420 transitions, 3916 flow
[2024-03-09 02:37:18,681 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3916, PETRI_PLACES=114, PETRI_TRANSITIONS=420}
[2024-03-09 02:37:18,681 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 47 predicate places.
[2024-03-09 02:37:18,681 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 420 transitions, 3916 flow
[2024-03-09 02:37:18,682 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 97.125) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:18,682 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:18,682 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:37:18,682 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-09 02:37:18,682 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:18,682 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:18,682 INFO  L85        PathProgramCache]: Analyzing trace with hash 1215917229, now seen corresponding path program 1 times
[2024-03-09 02:37:18,682 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:18,682 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20356815]
[2024-03-09 02:37:18,682 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:18,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:18,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:18,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-03-09 02:37:18,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:18,882 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20356815]
[2024-03-09 02:37:18,882 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20356815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:18,882 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:37:18,882 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:37:18,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118516593]
[2024-03-09 02:37:18,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:18,882 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:37:18,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:18,883 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:37:18,883 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:37:19,026 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 220
[2024-03-09 02:37:19,026 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 420 transitions, 3916 flow. Second operand  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:19,027 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:19,027 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 220
[2024-03-09 02:37:19,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:23,674 INFO  L130       PetriNetUnfolder]: 18158/31406 cut-off events.
[2024-03-09 02:37:23,674 INFO  L131       PetriNetUnfolder]: For 123674/124225 co-relation queries the response was YES.
[2024-03-09 02:37:23,780 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 146145 conditions, 31406 events. 18158/31406 cut-off events. For 123674/124225 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 247090 event pairs, 4204 based on Foata normal form. 54/29250 useless extension candidates. Maximal degree in co-relation 146113. Up to 23999 conditions per place. 
[2024-03-09 02:37:23,887 INFO  L137   encePairwiseOnDemand]: 194/220 looper letters, 446 selfloop transitions, 164 changer transitions 1/626 dead transitions.
[2024-03-09 02:37:23,887 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 626 transitions, 6684 flow
[2024-03-09 02:37:23,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:37:23,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:37:23,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 784 transitions.
[2024-03-09 02:37:23,889 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.593939393939394
[2024-03-09 02:37:23,889 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 784 transitions.
[2024-03-09 02:37:23,889 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 784 transitions.
[2024-03-09 02:37:23,889 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:23,889 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 784 transitions.
[2024-03-09 02:37:23,891 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 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)
[2024-03-09 02:37:23,892 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:23,893 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:23,893 INFO  L175             Difference]: Start difference. First operand has 114 places, 420 transitions, 3916 flow. Second operand 6 states and 784 transitions.
[2024-03-09 02:37:23,893 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 626 transitions, 6684 flow
[2024-03-09 02:37:24,327 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 626 transitions, 6646 flow, removed 19 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:24,333 INFO  L231             Difference]: Finished difference. Result has 123 places, 535 transitions, 5508 flow
[2024-03-09 02:37:24,333 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=3878, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5508, PETRI_PLACES=123, PETRI_TRANSITIONS=535}
[2024-03-09 02:37:24,334 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 56 predicate places.
[2024-03-09 02:37:24,334 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 535 transitions, 5508 flow
[2024-03-09 02:37:24,334 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:24,334 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:24,334 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]
[2024-03-09 02:37:24,334 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-09 02:37:24,334 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:24,335 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:24,335 INFO  L85        PathProgramCache]: Analyzing trace with hash -536985687, now seen corresponding path program 1 times
[2024-03-09 02:37:24,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:24,335 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757893887]
[2024-03-09 02:37:24,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:24,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:24,353 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:24,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:24,410 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:24,410 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757893887]
[2024-03-09 02:37:24,410 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757893887] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:37:24,410 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370795194]
[2024-03-09 02:37:24,410 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:24,410 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:37:24,410 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:37:24,411 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:37:24,413 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-09 02:37:24,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:24,548 INFO  L263         TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-09 02:37:24,550 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:37:24,600 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:24,600 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 02:37:24,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:24,633 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [370795194] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 02:37:24,633 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 02:37:24,633 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-03-09 02:37:24,633 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652635163]
[2024-03-09 02:37:24,633 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 02:37:24,633 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-09 02:37:24,634 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:24,634 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-09 02:37:24,634 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-09 02:37:24,727 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 220
[2024-03-09 02:37:24,728 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 535 transitions, 5508 flow. Second operand  has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:24,728 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:24,728 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 220
[2024-03-09 02:37:24,729 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:25,868 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([522] L1016-4-->L1016-6: Formula: (= (store |v_#race_60| v_~datas~0.base_57 (store (select |v_#race_60| v_~datas~0.base_57) (+ v_~datas~0.offset_51 (* v_threadThread2of2ForFork0_~i~0_23 4)) |v_threadThread2of2ForFork0_#t~nondet4_21|)) |v_#race_59|)  InVars {#race=|v_#race_60|, ~datas~0.base=v_~datas~0.base_57, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_23}  OutVars{#race=|v_#race_59|, ~datas~0.base=v_~datas~0.base_57, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_21|, ~datas~0.offset=v_~datas~0.offset_51, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][109], [Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 194#(and (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 240#(and (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), threadThread1of2ForFork0InUse, 157#(= |#race~datas~0| 0), Black: 244#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), threadThread2of2ForFork0InUse, 530#(and (<= 0 |ULTIMATE.start_main_~i~1#1|) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 337#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 101#L1025-8true, Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 334#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 335#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 333#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 145#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 46#threadEXITtrue, Black: 148#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 155#true, Black: 350#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset))) (= (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 3 ~datas~0.offset)) |threadThread2of2ForFork0_#t~nondet4|)), Black: 349#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) 2 ~datas~0.offset)))), Black: 348#(and (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset 1))) (= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset)))), 172#true, Black: 162#(= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 2 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 3 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_#t~mem14#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem14#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) 1 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0)), 125#L1016-6true, Black: 177#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 140#true, Black: 175#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 347#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), 143#true, Black: 176#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 174#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), 332#(not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)), 160#true])
[2024-03-09 02:37:25,868 INFO  L383   tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event
[2024-03-09 02:37:25,868 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-03-09 02:37:25,869 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-03-09 02:37:25,869 INFO  L386   tUnfolder$Statistics]:   existing Event has 39 ancestors and is cut-off event
[2024-03-09 02:37:27,151 INFO  L130       PetriNetUnfolder]: 7723/16643 cut-off events.
[2024-03-09 02:37:27,151 INFO  L131       PetriNetUnfolder]: For 78292/81894 co-relation queries the response was YES.
[2024-03-09 02:37:27,210 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80102 conditions, 16643 events. 7723/16643 cut-off events. For 78292/81894 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 148758 event pairs, 478 based on Foata normal form. 439/16712 useless extension candidates. Maximal degree in co-relation 80065. Up to 6510 conditions per place. 
[2024-03-09 02:37:27,266 INFO  L137   encePairwiseOnDemand]: 213/220 looper letters, 168 selfloop transitions, 6 changer transitions 25/600 dead transitions.
[2024-03-09 02:37:27,266 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 600 transitions, 6451 flow
[2024-03-09 02:37:27,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-09 02:37:27,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-09 02:37:27,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1012 transitions.
[2024-03-09 02:37:27,268 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.575
[2024-03-09 02:37:27,269 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1012 transitions.
[2024-03-09 02:37:27,269 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1012 transitions.
[2024-03-09 02:37:27,269 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:27,269 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1012 transitions.
[2024-03-09 02:37:27,271 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:27,272 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:27,273 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 220.0) internal successors, (1980), 9 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:27,273 INFO  L175             Difference]: Start difference. First operand has 123 places, 535 transitions, 5508 flow. Second operand 8 states and 1012 transitions.
[2024-03-09 02:37:27,273 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 600 transitions, 6451 flow
[2024-03-09 02:37:27,737 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 600 transitions, 6261 flow, removed 95 selfloop flow, removed 0 redundant places.
[2024-03-09 02:37:27,743 INFO  L231             Difference]: Finished difference. Result has 134 places, 492 transitions, 4903 flow
[2024-03-09 02:37:27,744 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=5011, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4903, PETRI_PLACES=134, PETRI_TRANSITIONS=492}
[2024-03-09 02:37:27,744 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 67 predicate places.
[2024-03-09 02:37:27,744 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 492 transitions, 4903 flow
[2024-03-09 02:37:27,745 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:27,745 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:27,745 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]
[2024-03-09 02:37:27,754 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-03-09 02:37:27,946 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:37:27,946 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:27,947 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:27,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 760508491, now seen corresponding path program 1 times
[2024-03-09 02:37:27,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:27,947 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385917142]
[2024-03-09 02:37:27,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:27,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:27,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:28,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:28,334 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:28,334 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385917142]
[2024-03-09 02:37:28,334 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385917142] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:37:28,334 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342322970]
[2024-03-09 02:37:28,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:28,334 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:37:28,334 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:37:28,335 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:37:28,338 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-09 02:37:28,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:28,456 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-03-09 02:37:28,458 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:37:28,470 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:28,475 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 26 treesize of output 24
[2024-03-09 02:37:28,583 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 02:37:28,584 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-03-09 02:37:28,615 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:28,616 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 24 treesize of output 24
[2024-03-09 02:37:28,644 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 13
[2024-03-09 02:37:28,662 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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
[2024-03-09 02:37:28,677 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 28 treesize of output 27
[2024-03-09 02:37:28,695 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:37:28,695 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 02:37:28,727 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:37:28,728 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 02:37:28,762 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 54 treesize of output 50
[2024-03-09 02:37:28,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 02:37:28,773 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 02:37:28,773 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342322970] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:28,773 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 02:37:28,773 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 12
[2024-03-09 02:37:28,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981384952]
[2024-03-09 02:37:28,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:28,774 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-09 02:37:28,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:28,774 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-09 02:37:28,774 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2024-03-09 02:37:29,101 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 220
[2024-03-09 02:37:29,102 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 492 transitions, 4903 flow. Second operand  has 10 states, 10 states have (on average 92.4) internal successors, (924), 10 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:29,102 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:29,102 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 220
[2024-03-09 02:37:29,102 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:33,894 INFO  L130       PetriNetUnfolder]: 16068/28221 cut-off events.
[2024-03-09 02:37:33,894 INFO  L131       PetriNetUnfolder]: For 149522/149869 co-relation queries the response was YES.
[2024-03-09 02:37:34,022 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 147461 conditions, 28221 events. 16068/28221 cut-off events. For 149522/149869 co-relation queries the response was YES. Maximal size of possible extension queue 930. Compared 220862 event pairs, 2413 based on Foata normal form. 231/28250 useless extension candidates. Maximal degree in co-relation 147419. Up to 10207 conditions per place. 
[2024-03-09 02:37:34,134 INFO  L137   encePairwiseOnDemand]: 204/220 looper letters, 919 selfloop transitions, 284 changer transitions 35/1250 dead transitions.
[2024-03-09 02:37:34,134 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 1250 transitions, 15473 flow
[2024-03-09 02:37:34,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-09 02:37:34,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-09 02:37:34,137 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1178 transitions.
[2024-03-09 02:37:34,137 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.48677685950413224
[2024-03-09 02:37:34,137 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1178 transitions.
[2024-03-09 02:37:34,137 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1178 transitions.
[2024-03-09 02:37:34,138 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:34,138 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1178 transitions.
[2024-03-09 02:37:34,140 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 107.0909090909091) internal successors, (1178), 11 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:34,142 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 220.0) internal successors, (2640), 12 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:34,143 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 220.0) internal successors, (2640), 12 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:34,143 INFO  L175             Difference]: Start difference. First operand has 134 places, 492 transitions, 4903 flow. Second operand 11 states and 1178 transitions.
[2024-03-09 02:37:34,143 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 1250 transitions, 15473 flow
[2024-03-09 02:37:34,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 1250 transitions, 15190 flow, removed 36 selfloop flow, removed 3 redundant places.
[2024-03-09 02:37:34,803 INFO  L231             Difference]: Finished difference. Result has 146 places, 746 transitions, 9163 flow
[2024-03-09 02:37:34,803 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=4798, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9163, PETRI_PLACES=146, PETRI_TRANSITIONS=746}
[2024-03-09 02:37:34,804 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 79 predicate places.
[2024-03-09 02:37:34,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 746 transitions, 9163 flow
[2024-03-09 02:37:34,804 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 92.4) internal successors, (924), 10 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:34,804 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:34,805 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]
[2024-03-09 02:37:34,811 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-09 02:37:35,005 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-03-09 02:37:35,006 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:35,007 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:35,007 INFO  L85        PathProgramCache]: Analyzing trace with hash 244372249, now seen corresponding path program 2 times
[2024-03-09 02:37:35,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:35,008 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467116347]
[2024-03-09 02:37:35,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:35,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:35,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:35,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:35,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:35,512 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467116347]
[2024-03-09 02:37:35,512 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467116347] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:37:35,512 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077380937]
[2024-03-09 02:37:35,512 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 02:37:35,512 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:37:35,512 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:37:35,513 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:37:35,517 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-09 02:37:35,612 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 02:37:35,612 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 02:37:35,614 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-09 02:37:35,618 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:37:35,627 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 18 treesize of output 16
[2024-03-09 02:37:35,730 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 02:37:35,730 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-03-09 02:37:35,758 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 24 treesize of output 24
[2024-03-09 02:37:35,772 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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
[2024-03-09 02:37:35,799 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 02:37:35,840 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:37:35,840 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 02:37:35,935 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 13
[2024-03-09 02:37:35,972 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-03-09 02:37:36,000 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:37:36,001 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 02:37:36,058 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 02:37:36,086 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 02:37:36,210 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 02:37:36,267 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 54 treesize of output 50
[2024-03-09 02:37:36,274 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:36,275 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 02:37:36,275 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077380937] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:36,275 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 02:37:36,275 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2024-03-09 02:37:36,275 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763720844]
[2024-03-09 02:37:36,275 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:36,276 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-03-09 02:37:36,276 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:36,276 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-03-09 02:37:36,276 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2024-03-09 02:37:36,718 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 220
[2024-03-09 02:37:36,719 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 746 transitions, 9163 flow. Second operand  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:36,719 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:36,719 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 220
[2024-03-09 02:37:36,720 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:44,200 INFO  L130       PetriNetUnfolder]: 17191/30263 cut-off events.
[2024-03-09 02:37:44,201 INFO  L131       PetriNetUnfolder]: For 203962/204328 co-relation queries the response was YES.
[2024-03-09 02:37:44,353 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 172299 conditions, 30263 events. 17191/30263 cut-off events. For 203962/204328 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 238830 event pairs, 2198 based on Foata normal form. 278/30358 useless extension candidates. Maximal degree in co-relation 172252. Up to 12908 conditions per place. 
[2024-03-09 02:37:44,471 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 824 selfloop transitions, 531 changer transitions 48/1415 dead transitions.
[2024-03-09 02:37:44,471 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 1415 transitions, 18867 flow
[2024-03-09 02:37:44,473 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-09 02:37:44,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-09 02:37:44,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1666 transitions.
[2024-03-09 02:37:44,477 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5048484848484849
[2024-03-09 02:37:44,477 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1666 transitions.
[2024-03-09 02:37:44,477 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1666 transitions.
[2024-03-09 02:37:44,478 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:44,478 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1666 transitions.
[2024-03-09 02:37:44,481 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 111.06666666666666) internal successors, (1666), 15 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:44,484 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 220.0) internal successors, (3520), 16 states have internal predecessors, (3520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:44,485 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 220.0) internal successors, (3520), 16 states have internal predecessors, (3520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:44,485 INFO  L175             Difference]: Start difference. First operand has 146 places, 746 transitions, 9163 flow. Second operand 15 states and 1666 transitions.
[2024-03-09 02:37:44,485 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 1415 transitions, 18867 flow
[2024-03-09 02:37:46,122 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 1415 transitions, 18801 flow, removed 25 selfloop flow, removed 2 redundant places.
[2024-03-09 02:37:46,138 INFO  L231             Difference]: Finished difference. Result has 164 places, 994 transitions, 14214 flow
[2024-03-09 02:37:46,138 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=9122, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=293, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14214, PETRI_PLACES=164, PETRI_TRANSITIONS=994}
[2024-03-09 02:37:46,139 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 97 predicate places.
[2024-03-09 02:37:46,139 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 994 transitions, 14214 flow
[2024-03-09 02:37:46,140 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 92.18181818181819) internal successors, (1014), 11 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:46,140 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:46,140 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]
[2024-03-09 02:37:46,146 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-09 02:37:46,341 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:37:46,342 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:46,342 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:46,343 INFO  L85        PathProgramCache]: Analyzing trace with hash -2051933622, now seen corresponding path program 1 times
[2024-03-09 02:37:46,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:46,343 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004155372]
[2024-03-09 02:37:46,343 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:46,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:46,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:46,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:46,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:46,735 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004155372]
[2024-03-09 02:37:46,735 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004155372] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:37:46,735 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044245494]
[2024-03-09 02:37:46,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:46,736 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:37:46,736 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:37:46,737 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:37:46,739 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-09 02:37:46,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:46,842 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-03-09 02:37:46,845 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:37:46,858 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:46,861 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 26 treesize of output 24
[2024-03-09 02:37:46,965 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 02:37:46,965 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2024-03-09 02:37:46,991 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:46,992 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 24 treesize of output 24
[2024-03-09 02:37:47,020 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 13
[2024-03-09 02:37:47,035 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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
[2024-03-09 02:37:47,045 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 28 treesize of output 27
[2024-03-09 02:37:47,056 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:37:47,056 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 02:37:47,072 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:37:47,072 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 02:37:47,086 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 54 treesize of output 50
[2024-03-09 02:37:47,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 02:37:47,095 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 02:37:47,095 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044245494] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:37:47,095 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 02:37:47,095 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 12
[2024-03-09 02:37:47,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801518021]
[2024-03-09 02:37:47,096 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:37:47,096 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-09 02:37:47,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:47,096 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-09 02:37:47,096 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182
[2024-03-09 02:37:47,752 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 220
[2024-03-09 02:37:47,753 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 994 transitions, 14214 flow. Second operand  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:47,753 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:47,753 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 220
[2024-03-09 02:37:47,753 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:37:54,059 INFO  L130       PetriNetUnfolder]: 14519/26970 cut-off events.
[2024-03-09 02:37:54,060 INFO  L131       PetriNetUnfolder]: For 259673/261070 co-relation queries the response was YES.
[2024-03-09 02:37:54,200 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 169013 conditions, 26970 events. 14519/26970 cut-off events. For 259673/261070 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 224732 event pairs, 1149 based on Foata normal form. 502/27009 useless extension candidates. Maximal degree in co-relation 168960. Up to 10064 conditions per place. 
[2024-03-09 02:37:54,381 INFO  L137   encePairwiseOnDemand]: 209/220 looper letters, 1230 selfloop transitions, 98 changer transitions 15/1481 dead transitions.
[2024-03-09 02:37:54,381 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 1481 transitions, 23541 flow
[2024-03-09 02:37:54,382 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-03-09 02:37:54,382 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-03-09 02:37:54,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1075 transitions.
[2024-03-09 02:37:54,384 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5429292929292929
[2024-03-09 02:37:54,384 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1075 transitions.
[2024-03-09 02:37:54,384 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1075 transitions.
[2024-03-09 02:37:54,384 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:37:54,385 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1075 transitions.
[2024-03-09 02:37:54,386 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 119.44444444444444) internal successors, (1075), 9 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:54,406 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:54,406 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:54,407 INFO  L175             Difference]: Start difference. First operand has 164 places, 994 transitions, 14214 flow. Second operand 9 states and 1075 transitions.
[2024-03-09 02:37:54,407 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 1481 transitions, 23541 flow
[2024-03-09 02:37:56,345 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 1481 transitions, 22871 flow, removed 328 selfloop flow, removed 3 redundant places.
[2024-03-09 02:37:56,362 INFO  L231             Difference]: Finished difference. Result has 166 places, 993 transitions, 13840 flow
[2024-03-09 02:37:56,363 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=13644, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=895, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13840, PETRI_PLACES=166, PETRI_TRANSITIONS=993}
[2024-03-09 02:37:56,363 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 99 predicate places.
[2024-03-09 02:37:56,363 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 993 transitions, 13840 flow
[2024-03-09 02:37:56,364 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:56,364 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:37:56,364 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]
[2024-03-09 02:37:56,371 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-09 02:37:56,565 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-03-09 02:37:56,566 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:37:56,566 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:37:56,566 INFO  L85        PathProgramCache]: Analyzing trace with hash 1915501259, now seen corresponding path program 3 times
[2024-03-09 02:37:56,567 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:37:56,567 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633029157]
[2024-03-09 02:37:56,567 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:37:56,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:37:56,588 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:37:57,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:57,013 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:37:57,013 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633029157]
[2024-03-09 02:37:57,013 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633029157] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:37:57,013 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890588479]
[2024-03-09 02:37:57,013 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 02:37:57,013 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:37:57,014 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:37:57,014 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:37:57,016 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-09 02:37:57,193 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 02:37:57,194 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 02:37:57,195 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 58 conjunts are in the unsatisfiable core
[2024-03-09 02:37:57,200 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:37:57,213 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 18 treesize of output 16
[2024-03-09 02:37:57,402 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:37:57,403 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-09 02:37:57,419 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 02:37:57,420 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 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-09 02:37:57,537 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 24 treesize of output 24
[2024-03-09 02:37:57,552 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-09 02:37:57,625 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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
[2024-03-09 02:37:57,689 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 02:37:57,754 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3
[2024-03-09 02:37:57,765 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 13
[2024-03-09 02:37:57,813 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2024-03-09 02:37:57,837 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 02:37:57,980 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 02:37:58,051 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 02:37:58,078 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 02:37:58,103 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 02:37:58,184 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 54 treesize of output 50
[2024-03-09 02:37:58,225 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:58,226 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 02:37:58,249 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_942 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_942 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_942 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_942 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-03-09 02:37:58,300 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-03-09 02:37:58,355 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false
[2024-03-09 02:37:58,709 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse4)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ c_~datas~0.offset 2 .cse4))) (and (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_934 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse0 c_~datas~0.base (store (store (select .cse0 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse3 v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_934 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse5 c_~datas~0.base (store (store (select .cse5 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse3 v_ArrVal_942) c_~datas~0.base) (+ c_~datas~0.offset .cse4 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_934 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse6 c_~datas~0.base (store (store (select .cse6 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse3 v_ArrVal_942) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_934 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse7 c_~datas~0.base (store (store (select .cse7 c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse3 v_ArrVal_942) c_~datas~0.base) .cse1)))))) is different from false
[2024-03-09 02:37:58,912 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:37:58,913 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 74
[2024-03-09 02:37:58,926 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:37:58,926 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 389 treesize of output 256
[2024-03-09 02:37:58,943 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 170 treesize of output 158
[2024-03-09 02:37:58,947 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 228 treesize of output 210
[2024-03-09 02:37:58,955 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 210 treesize of output 174
[2024-03-09 02:37:59,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:37:59,192 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890588479] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 02:37:59,192 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 02:37:59,192 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30
[2024-03-09 02:37:59,192 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213339364]
[2024-03-09 02:37:59,192 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 02:37:59,193 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-09 02:37:59,193 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:37:59,193 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-09 02:37:59,193 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=589, Unknown=45, NotChecked=220, Total=992
[2024-03-09 02:37:59,744 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 220
[2024-03-09 02:37:59,745 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 993 transitions, 13840 flow. Second operand  has 32 states, 32 states have (on average 69.3125) internal successors, (2218), 32 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:37:59,745 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:37:59,745 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 220
[2024-03-09 02:37:59,745 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:38:14,262 INFO  L130       PetriNetUnfolder]: 25793/42675 cut-off events.
[2024-03-09 02:38:14,263 INFO  L131       PetriNetUnfolder]: For 367243/367243 co-relation queries the response was YES.
[2024-03-09 02:38:14,498 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 264904 conditions, 42675 events. 25793/42675 cut-off events. For 367243/367243 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 322725 event pairs, 4171 based on Foata normal form. 264/42939 useless extension candidates. Maximal degree in co-relation 264853. Up to 17515 conditions per place. 
[2024-03-09 02:38:14,662 INFO  L137   encePairwiseOnDemand]: 179/220 looper letters, 1199 selfloop transitions, 632 changer transitions 56/1890 dead transitions.
[2024-03-09 02:38:14,662 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 1890 transitions, 27741 flow
[2024-03-09 02:38:14,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-09 02:38:14,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-09 02:38:14,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2091 transitions.
[2024-03-09 02:38:14,666 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3801818181818182
[2024-03-09 02:38:14,666 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 2091 transitions.
[2024-03-09 02:38:14,666 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 2091 transitions.
[2024-03-09 02:38:14,667 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:38:14,667 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2091 transitions.
[2024-03-09 02:38:14,669 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 83.64) internal successors, (2091), 25 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:38:14,673 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 220.0) internal successors, (5720), 26 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:38:14,673 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 220.0) internal successors, (5720), 26 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:38:14,673 INFO  L175             Difference]: Start difference. First operand has 166 places, 993 transitions, 13840 flow. Second operand 25 states and 2091 transitions.
[2024-03-09 02:38:14,674 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 1890 transitions, 27741 flow
[2024-03-09 02:38:17,344 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1890 transitions, 27353 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-03-09 02:38:17,444 INFO  L231             Difference]: Finished difference. Result has 192 places, 1268 transitions, 20006 flow
[2024-03-09 02:38:17,444 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=13644, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=383, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=20006, PETRI_PLACES=192, PETRI_TRANSITIONS=1268}
[2024-03-09 02:38:17,445 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 125 predicate places.
[2024-03-09 02:38:17,445 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 1268 transitions, 20006 flow
[2024-03-09 02:38:17,445 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 69.3125) internal successors, (2218), 32 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:38:17,445 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:38:17,446 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]
[2024-03-09 02:38:17,454 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-09 02:38:17,646 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:38:17,647 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:38:17,648 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:38:17,648 INFO  L85        PathProgramCache]: Analyzing trace with hash 226769919, now seen corresponding path program 4 times
[2024-03-09 02:38:17,648 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:38:17,649 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848247551]
[2024-03-09 02:38:17,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:38:17,649 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:38:17,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:38:18,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:38:18,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:38:18,107 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848247551]
[2024-03-09 02:38:18,107 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848247551] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:38:18,107 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901388777]
[2024-03-09 02:38:18,107 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 02:38:18,107 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:38:18,107 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:38:18,109 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:38:18,114 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-09 02:38:18,393 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 02:38:18,394 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 02:38:18,395 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 61 conjunts are in the unsatisfiable core
[2024-03-09 02:38:18,403 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:38:18,415 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:38:18,418 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 26 treesize of output 24
[2024-03-09 02:38:18,622 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 02:38:18,622 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 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-09 02:38:18,631 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:38:18,632 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 14 treesize of output 16
[2024-03-09 02:38:18,821 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:38:18,822 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 14 treesize of output 16
[2024-03-09 02:38:18,828 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:38:18,829 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 24 treesize of output 24
[2024-03-09 02:38:18,989 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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
[2024-03-09 02:38:19,074 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7
[2024-03-09 02:38:19,090 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 13
[2024-03-09 02:38:19,150 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 02:38:19,221 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 02:38:19,301 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 02:38:19,392 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:38:19,393 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 02:38:19,425 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:38:19,426 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 02:38:19,486 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:38:19,487 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 02:38:19,533 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:38:19,535 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-09 02:38:19,654 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 67
[2024-03-09 02:38:19,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:38:19,701 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 02:38:19,884 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1055 Int) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1055))) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse2)))) (forall ((v_ArrVal_1055 Int) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1055))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)))) (forall ((v_ArrVal_1055 Int) (v_ArrVal_1054 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1055))) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1055 Int) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_1055))) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))))) is different from false
[2024-03-09 02:38:26,021 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:38:26,022 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 90
[2024-03-09 02:38:26,041 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:38:26,041 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 445 treesize of output 415
[2024-03-09 02:38:26,063 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 457 treesize of output 408
[2024-03-09 02:38:26,091 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 156 treesize of output 142
[2024-03-09 02:38:26,244 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:38:26,244 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 81
[2024-03-09 02:38:26,310 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:38:26,311 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 90
[2024-03-09 02:38:26,321 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 02:38:26,337 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 02:38:26,337 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 157
[2024-03-09 02:38:26,350 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 71 treesize of output 64
[2024-03-09 02:38:26,361 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 110
[2024-03-09 02:38:26,404 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 02:38:26,404 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 1
[2024-03-09 02:38:26,426 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:38:26,426 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 89
[2024-03-09 02:38:26,434 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-09 02:38:26,449 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-09 02:38:26,450 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 189
[2024-03-09 02:38:26,464 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 94 treesize of output 88
[2024-03-09 02:38:26,479 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 136
[2024-03-09 02:38:27,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:38:27,603 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901388777] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 02:38:27,603 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 02:38:27,603 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 36
[2024-03-09 02:38:27,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49823663]
[2024-03-09 02:38:27,604 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 02:38:27,604 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2024-03-09 02:38:27,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:38:27,605 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2024-03-09 02:38:27,606 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1082, Unknown=33, NotChecked=70, Total=1406
[2024-03-09 02:38:29,111 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 220
[2024-03-09 02:38:29,114 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 1268 transitions, 20006 flow. Second operand  has 38 states, 38 states have (on average 60.10526315789474) internal successors, (2284), 38 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:38:29,114 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:38:29,115 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 220
[2024-03-09 02:38:29,115 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:38:34,713 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:38:36,952 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:38:40,291 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:38:49,590 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:38:54,885 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 02:39:31,610 INFO  L130       PetriNetUnfolder]: 53909/88953 cut-off events.
[2024-03-09 02:39:31,610 INFO  L131       PetriNetUnfolder]: For 1277524/1277536 co-relation queries the response was YES.
[2024-03-09 02:39:32,292 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 678403 conditions, 88953 events. 53909/88953 cut-off events. For 1277524/1277536 co-relation queries the response was YES. Maximal size of possible extension queue 2317. Compared 738716 event pairs, 7238 based on Foata normal form. 454/89405 useless extension candidates. Maximal degree in co-relation 678342. Up to 28338 conditions per place. 
[2024-03-09 02:39:32,693 INFO  L137   encePairwiseOnDemand]: 184/220 looper letters, 2800 selfloop transitions, 1144 changer transitions 478/4425 dead transitions.
[2024-03-09 02:39:32,693 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 4425 transitions, 74548 flow
[2024-03-09 02:39:32,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. 
[2024-03-09 02:39:32,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 42 states.
[2024-03-09 02:39:32,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 3185 transitions.
[2024-03-09 02:39:32,697 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3446969696969697
[2024-03-09 02:39:32,698 INFO  L72            ComplementDD]: Start complementDD. Operand 42 states and 3185 transitions.
[2024-03-09 02:39:32,698 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 42 states and 3185 transitions.
[2024-03-09 02:39:32,698 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:39:32,699 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 3185 transitions.
[2024-03-09 02:39:32,702 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 43 states, 42 states have (on average 75.83333333333333) internal successors, (3185), 42 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:39:32,707 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 43 states, 43 states have (on average 220.0) internal successors, (9460), 43 states have internal predecessors, (9460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:39:32,708 INFO  L81            ComplementDD]: Finished complementDD. Result  has 43 states, 43 states have (on average 220.0) internal successors, (9460), 43 states have internal predecessors, (9460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:39:32,708 INFO  L175             Difference]: Start difference. First operand has 192 places, 1268 transitions, 20006 flow. Second operand 42 states and 3185 transitions.
[2024-03-09 02:39:32,708 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 4425 transitions, 74548 flow
[2024-03-09 02:40:03,259 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 4425 transitions, 72174 flow, removed 1011 selfloop flow, removed 11 redundant places.
[2024-03-09 02:40:03,303 INFO  L231             Difference]: Finished difference. Result has 250 places, 2083 transitions, 38352 flow
[2024-03-09 02:40:03,303 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=18983, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=379, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=792, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=38352, PETRI_PLACES=250, PETRI_TRANSITIONS=2083}
[2024-03-09 02:40:03,304 INFO  L288   CegarLoopForPetriNet]: 67 programPoint places, 183 predicate places.
[2024-03-09 02:40:03,304 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 2083 transitions, 38352 flow
[2024-03-09 02:40:03,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 38 states, 38 states have (on average 60.10526315789474) internal successors, (2284), 38 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:03,304 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:40:03,305 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2024-03-09 02:40:03,311 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-09 02:40:03,505 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:40:03,506 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] ===
[2024-03-09 02:40:03,507 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:40:03,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 1145920694, now seen corresponding path program 1 times
[2024-03-09 02:40:03,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:40:03,508 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650896335]
[2024-03-09 02:40:03,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:40:03,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:40:03,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 02:40:03,531 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 02:40:03,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 02:40:03,545 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 02:40:03,546 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 02:40:03,546 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining)
[2024-03-09 02:40:03,546 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining)
[2024-03-09 02:40:03,546 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining)
[2024-03-09 02:40:03,546 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining)
[2024-03-09 02:40:03,546 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining)
[2024-03-09 02:40:03,547 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining)
[2024-03-09 02:40:03,547 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining)
[2024-03-09 02:40:03,547 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining)
[2024-03-09 02:40:03,547 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining)
[2024-03-09 02:40:03,547 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining)
[2024-03-09 02:40:03,547 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining)
[2024-03-09 02:40:03,547 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining)
[2024-03-09 02:40:03,548 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining)
[2024-03-09 02:40:03,548 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-03-09 02:40:03,548 INFO  L445         BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:40:03,548 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 02:40:03,548 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-09 02:40:03,566 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-03-09 02:40:03,567 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2024-03-09 02:40:03,598 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2024-03-09 02:40:03,599 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-03-09 02:40:03,600 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1515 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2024-03-09 02:40:03,600 INFO  L82        GeneralOperation]: Start removeDead. Operand has 159 places, 158 transitions, 346 flow
[2024-03-09 02:40:03,602 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 159 places, 158 transitions, 346 flow
[2024-03-09 02:40:03,602 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-09 02:40:03,602 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 158 transitions, 346 flow
[2024-03-09 02:40:03,602 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 158 transitions, 346 flow
[2024-03-09 02:40:03,602 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 158 transitions, 346 flow
[2024-03-09 02:40:03,634 INFO  L130       PetriNetUnfolder]: 21/503 cut-off events.
[2024-03-09 02:40:03,634 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2024-03-09 02:40:03,635 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 531 conditions, 503 events. 21/503 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1515 event pairs, 1 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 299. Up to 16 conditions per place. 
[2024-03-09 02:40:03,644 INFO  L119        LiptonReduction]: Number of co-enabled transitions 9576
[2024-03-09 02:40:06,214 INFO  L134        LiptonReduction]: Checked pairs total: 47214
[2024-03-09 02:40:06,214 INFO  L136        LiptonReduction]: Total number of compositions: 92
[2024-03-09 02:40:06,216 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 02:40:06,217 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;@1f3e1c8f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-09 02:40:06,217 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-03-09 02:40:06,218 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2024-03-09 02:40:06,218 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-09 02:40:06,218 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:40:06,218 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2024-03-09 02:40:06,218 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-09 02:40:06,219 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:40:06,219 INFO  L85        PathProgramCache]: Analyzing trace with hash 895, now seen corresponding path program 1 times
[2024-03-09 02:40:06,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:40:06,219 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595631065]
[2024-03-09 02:40:06,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:40:06,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:40:06,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:40:06,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:40:06,223 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:40:06,223 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595631065]
[2024-03-09 02:40:06,223 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595631065] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:40:06,223 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:40:06,224 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2024-03-09 02:40:06,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273419946]
[2024-03-09 02:40:06,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:40:06,224 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-03-09 02:40:06,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:40:06,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-03-09 02:40:06,225 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-03-09 02:40:06,225 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 250
[2024-03-09 02:40:06,225 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 182 flow. Second operand  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:06,225 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:40:06,226 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 250
[2024-03-09 02:40:06,226 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:40:06,843 INFO  L130       PetriNetUnfolder]: 3680/8504 cut-off events.
[2024-03-09 02:40:06,843 INFO  L131       PetriNetUnfolder]: For 658/1638 co-relation queries the response was YES.
[2024-03-09 02:40:06,855 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14271 conditions, 8504 events. 3680/8504 cut-off events. For 658/1638 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 72179 event pairs, 3637 based on Foata normal form. 0/7831 useless extension candidates. Maximal degree in co-relation 11836. Up to 5535 conditions per place. 
[2024-03-09 02:40:06,880 INFO  L137   encePairwiseOnDemand]: 249/250 looper letters, 28 selfloop transitions, 0 changer transitions 0/75 dead transitions.
[2024-03-09 02:40:06,880 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 236 flow
[2024-03-09 02:40:06,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-03-09 02:40:06,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-03-09 02:40:06,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 327 transitions.
[2024-03-09 02:40:06,882 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.654
[2024-03-09 02:40:06,882 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 327 transitions.
[2024-03-09 02:40:06,882 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 327 transitions.
[2024-03-09 02:40:06,882 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:40:06,883 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 327 transitions.
[2024-03-09 02:40:06,883 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 163.5) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:06,884 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:06,884 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:06,884 INFO  L175             Difference]: Start difference. First operand has 80 places, 76 transitions, 182 flow. Second operand 2 states and 327 transitions.
[2024-03-09 02:40:06,884 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 236 flow
[2024-03-09 02:40:06,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:40:06,886 INFO  L231             Difference]: Finished difference. Result has 80 places, 75 transitions, 180 flow
[2024-03-09 02:40:06,886 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=80, PETRI_TRANSITIONS=75}
[2024-03-09 02:40:06,887 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places.
[2024-03-09 02:40:06,887 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 180 flow
[2024-03-09 02:40:06,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:06,887 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:40:06,887 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:40:06,888 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-09 02:40:06,888 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-09 02:40:06,888 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:40:06,888 INFO  L85        PathProgramCache]: Analyzing trace with hash -93167708, now seen corresponding path program 1 times
[2024-03-09 02:40:06,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:40:06,888 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248997146]
[2024-03-09 02:40:06,889 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:40:06,889 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:40:06,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:40:07,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:40:07,007 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:40:07,008 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248997146]
[2024-03-09 02:40:07,008 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248997146] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:40:07,008 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:40:07,008 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:40:07,009 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149736843]
[2024-03-09 02:40:07,009 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:40:07,009 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:40:07,010 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:40:07,010 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:40:07,010 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:40:07,274 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 250
[2024-03-09 02:40:07,275 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 180 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)
[2024-03-09 02:40:07,275 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:40:07,275 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 250
[2024-03-09 02:40:07,275 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:40:14,357 INFO  L130       PetriNetUnfolder]: 75663/120904 cut-off events.
[2024-03-09 02:40:14,358 INFO  L131       PetriNetUnfolder]: For 3728/4209 co-relation queries the response was YES.
[2024-03-09 02:40:14,543 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 231350 conditions, 120904 events. 75663/120904 cut-off events. For 3728/4209 co-relation queries the response was YES. Maximal size of possible extension queue 2764. Compared 1003579 event pairs, 19231 based on Foata normal form. 157/116595 useless extension candidates. Maximal degree in co-relation 231344. Up to 73144 conditions per place. 
[2024-03-09 02:40:14,943 INFO  L137   encePairwiseOnDemand]: 219/250 looper letters, 111 selfloop transitions, 64 changer transitions 0/196 dead transitions.
[2024-03-09 02:40:14,943 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 196 transitions, 793 flow
[2024-03-09 02:40:14,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:40:14,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:40:14,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions.
[2024-03-09 02:40:14,946 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5826666666666667
[2024-03-09 02:40:14,946 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 874 transitions.
[2024-03-09 02:40:14,947 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 874 transitions.
[2024-03-09 02:40:14,947 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:40:14,948 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 874 transitions.
[2024-03-09 02:40:14,949 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 145.66666666666666) internal successors, (874), 6 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:14,952 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:14,952 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:14,953 INFO  L175             Difference]: Start difference. First operand has 80 places, 75 transitions, 180 flow. Second operand 6 states and 874 transitions.
[2024-03-09 02:40:14,953 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 196 transitions, 793 flow
[2024-03-09 02:40:14,958 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 196 transitions, 793 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:40:14,959 INFO  L231             Difference]: Finished difference. Result has 90 places, 139 transitions, 626 flow
[2024-03-09 02:40:14,960 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=90, PETRI_TRANSITIONS=139}
[2024-03-09 02:40:14,960 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 10 predicate places.
[2024-03-09 02:40:14,960 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 139 transitions, 626 flow
[2024-03-09 02:40:14,960 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)
[2024-03-09 02:40:14,961 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:40:14,961 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:40:14,961 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-09 02:40:14,961 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-09 02:40:14,961 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:40:14,961 INFO  L85        PathProgramCache]: Analyzing trace with hash 1118363942, now seen corresponding path program 1 times
[2024-03-09 02:40:14,962 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:40:14,962 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513812874]
[2024-03-09 02:40:14,962 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:40:14,962 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:40:14,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:40:14,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:40:14,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:40:14,983 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513812874]
[2024-03-09 02:40:14,983 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513812874] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:40:14,983 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:40:14,983 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 02:40:14,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378633611]
[2024-03-09 02:40:14,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:40:14,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 02:40:14,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:40:14,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 02:40:14,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 02:40:15,005 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 250
[2024-03-09 02:40:15,006 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 139 transitions, 626 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)
[2024-03-09 02:40:15,006 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:40:15,006 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 250
[2024-03-09 02:40:15,006 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:40:17,759 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_182| v_~datas~0.base_119)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_33 4))) (and (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_105))) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_105))) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_105)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_105)) |v_threadThread1of3ForFork0_#t~nondet4_26|)))  InVars {#race=|v_#race_182|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_119, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_182|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_119, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 85#threadEXITtrue, 165#true, 123#L1016-3true, 129#L1016-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-09 02:40:17,759 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2024-03-09 02:40:17,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-09 02:40:17,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-09 02:40:17,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-09 02:40:17,760 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_182| v_~datas~0.base_119)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_33 4))) (and (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_105))) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_105))) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_105)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_105)) |v_threadThread1of3ForFork0_#t~nondet4_26|)))  InVars {#race=|v_#race_182|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_119, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_182|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_119, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 81#L1016-3true, Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 85#threadEXITtrue, 165#true, 46#L1016-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-09 02:40:17,760 INFO  L383   tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event
[2024-03-09 02:40:17,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-09 02:40:17,761 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-09 02:40:17,761 INFO  L386   tUnfolder$Statistics]:   existing Event has 51 ancestors and is cut-off event
[2024-03-09 02:40:18,002 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_182| v_~datas~0.base_119)) (.cse1 (* v_threadThread1of3ForFork0_~i~0_33 4))) (and (= |v_threadThread1of3ForFork0_#res.base_9| 0) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ 2 .cse1 v_~datas~0.offset_105))) (= |v_threadThread1of3ForFork0_#t~nondet4_26| (select .cse0 (+ .cse1 v_~datas~0.offset_105))) (= 0 |v_threadThread1of3ForFork0_#res.offset_9|) (= (select .cse0 (+ 3 .cse1 v_~datas~0.offset_105)) |v_threadThread1of3ForFork0_#t~nondet4_26|) (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_105)) |v_threadThread1of3ForFork0_#t~nondet4_26|)))  InVars {#race=|v_#race_182|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_26|, ~datas~0.base=v_~datas~0.base_119, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  OutVars{threadThread1of3ForFork0_#t~nondet3=|v_threadThread1of3ForFork0_#t~nondet3_13|, #race=|v_#race_182|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_9|, ~datas~0.base=v_~datas~0.base_119, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_9|, ~datas~0.offset=v_~datas~0.offset_105, threadThread1of3ForFork0_~i~0=v_threadThread1of3ForFork0_~i~0_33}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet3, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][58], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 81#L1016-3true, Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 85#threadEXITtrue, 165#true, 123#L1016-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-09 02:40:18,003 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,003 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,003 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,003 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,004 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([801] L1016-4-->L1016-6: Formula: (= |v_#race_176| (store |v_#race_177| v_~datas~0.base_109 (store (select |v_#race_177| v_~datas~0.base_109) (+ (* v_threadThread2of3ForFork0_~i~0_29 4) v_~datas~0.offset_97) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_177|, ~datas~0.base=v_~datas~0.base_109, ~datas~0.offset=v_~datas~0.offset_97, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_29}  OutVars{#race=|v_#race_176|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_109, ~datas~0.offset=v_~datas~0.offset_97, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_29}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, 36#L1016-9true, 97#L1016-6true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 129#L1016-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-09 02:40:18,004 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,004 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,004 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,004 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,005 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([774] L1016-4-->L1016-6: Formula: (= |v_#race_162| (store |v_#race_163| v_~datas~0.base_99 (store (select |v_#race_163| v_~datas~0.base_99) (+ v_~datas~0.offset_87 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_163|, ~datas~0.base=v_~datas~0.base_99, ~datas~0.offset=v_~datas~0.offset_87, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_162|, ~datas~0.base=v_~datas~0.base_99, ~datas~0.offset=v_~datas~0.offset_87, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, 36#L1016-9true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 52#L1016-6true, Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 46#L1016-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-09 02:40:18,005 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,005 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,005 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,005 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-09 02:40:18,450 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([801] L1016-4-->L1016-6: Formula: (= |v_#race_176| (store |v_#race_177| v_~datas~0.base_109 (store (select |v_#race_177| v_~datas~0.base_109) (+ (* v_threadThread2of3ForFork0_~i~0_29 4) v_~datas~0.offset_97) |v_threadThread2of3ForFork0_#t~nondet4_21|)))  InVars {#race=|v_#race_177|, ~datas~0.base=v_~datas~0.base_109, ~datas~0.offset=v_~datas~0.offset_97, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_29}  OutVars{#race=|v_#race_176|, threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_21|, ~datas~0.base=v_~datas~0.base_109, ~datas~0.offset=v_~datas~0.offset_97, threadThread2of3ForFork0_~i~0=v_threadThread2of3ForFork0_~i~0_29}  AuxVars[]  AssignedVars[#race, threadThread2of3ForFork0_#t~nondet4][92], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, 36#L1016-9true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 97#L1016-6true, Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 81#L1016-3true, Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-09 02:40:18,450 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2024-03-09 02:40:18,450 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-09 02:40:18,450 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-09 02:40:18,451 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-09 02:40:18,451 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([774] L1016-4-->L1016-6: Formula: (= |v_#race_162| (store |v_#race_163| v_~datas~0.base_99 (store (select |v_#race_163| v_~datas~0.base_99) (+ v_~datas~0.offset_87 (* v_threadThread3of3ForFork0_~i~0_23 4)) |v_threadThread3of3ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_163|, ~datas~0.base=v_~datas~0.base_99, ~datas~0.offset=v_~datas~0.offset_87, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  OutVars{#race=|v_#race_162|, ~datas~0.base=v_~datas~0.base_99, ~datas~0.offset=v_~datas~0.offset_87, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_19|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_23}  AuxVars[]  AssignedVars[#race, threadThread3of3ForFork0_#t~nondet4][126], [threadThread3of3ForFork0InUse, 162#true, 2#ULTIMATE.startEXITtrue, 36#L1016-9true, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 52#L1016-6true, Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 165#true, 123#L1016-3true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse])
[2024-03-09 02:40:18,451 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2024-03-09 02:40:18,451 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-09 02:40:18,451 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-09 02:40:18,451 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-09 02:40:20,058 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([844] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_184| v_~datas~0.base_123)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_37 4))) (and (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_107)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_107))) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_107))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_107)))))  InVars {#race=|v_#race_184|, ~datas~0.base=v_~datas~0.base_123, ~datas~0.offset=v_~datas~0.offset_107, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_37}  OutVars{#race=|v_#race_184|, ~datas~0.base=v_~datas~0.base_123, ~datas~0.offset=v_~datas~0.offset_107, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_37}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 162#true, 6#threadEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 85#threadEXITtrue, 165#true, 82#L1028-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2024-03-09 02:40:20,059 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2024-03-09 02:40:20,059 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-09 02:40:20,059 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-09 02:40:20,059 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-09 02:40:20,059 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([844] L1016-9-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_184| v_~datas~0.base_123)) (.cse1 (* v_threadThread3of3ForFork0_~i~0_37 4))) (and (= (select .cse0 (+ .cse1 1 v_~datas~0.offset_107)) |v_threadThread3of3ForFork0_#t~nondet4_28|) (= 0 |v_threadThread3of3ForFork0_#res.offset_9|) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 2 v_~datas~0.offset_107))) (= |v_threadThread3of3ForFork0_#res.base_9| 0) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 3 v_~datas~0.offset_107))) (= |v_threadThread3of3ForFork0_#t~nondet4_28| (select .cse0 (+ .cse1 v_~datas~0.offset_107)))))  InVars {#race=|v_#race_184|, ~datas~0.base=v_~datas~0.base_123, ~datas~0.offset=v_~datas~0.offset_107, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_28|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_37}  OutVars{#race=|v_#race_184|, ~datas~0.base=v_~datas~0.base_123, ~datas~0.offset=v_~datas~0.offset_107, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_9|, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_9|, threadThread3of3ForFork0_#t~nondet3=|v_threadThread3of3ForFork0_#t~nondet3_13|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_37}  AuxVars[]  AssignedVars[threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#t~nondet4, threadThread3of3ForFork0_#t~nondet3][128], [threadThread3of3ForFork0InUse, 162#true, 6#threadEXITtrue, Black: 170#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 169#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 94#L1030true, Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 179#(= |#race~datas~0| 0), 85#threadEXITtrue, 165#true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0NotInUse])
[2024-03-09 02:40:20,059 INFO  L383   tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event
[2024-03-09 02:40:20,059 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-09 02:40:20,059 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-09 02:40:20,060 INFO  L386   tUnfolder$Statistics]:   existing Event has 72 ancestors and is cut-off event
[2024-03-09 02:40:20,215 INFO  L130       PetriNetUnfolder]: 36197/69248 cut-off events.
[2024-03-09 02:40:20,215 INFO  L131       PetriNetUnfolder]: For 38526/45070 co-relation queries the response was YES.
[2024-03-09 02:40:20,362 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 166376 conditions, 69248 events. 36197/69248 cut-off events. For 38526/45070 co-relation queries the response was YES. Maximal size of possible extension queue 2423. Compared 690518 event pairs, 15578 based on Foata normal form. 967/64851 useless extension candidates. Maximal degree in co-relation 166365. Up to 32701 conditions per place. 
[2024-03-09 02:40:20,575 INFO  L137   encePairwiseOnDemand]: 242/250 looper letters, 50 selfloop transitions, 4 changer transitions 0/147 dead transitions.
[2024-03-09 02:40:20,576 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 147 transitions, 764 flow
[2024-03-09 02:40:20,577 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 02:40:20,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 02:40:20,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions.
[2024-03-09 02:40:20,577 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6026666666666667
[2024-03-09 02:40:20,578 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 452 transitions.
[2024-03-09 02:40:20,578 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions.
[2024-03-09 02:40:20,578 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:40:20,578 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions.
[2024-03-09 02:40:20,579 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:20,579 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:20,579 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:20,580 INFO  L175             Difference]: Start difference. First operand has 90 places, 139 transitions, 626 flow. Second operand 3 states and 452 transitions.
[2024-03-09 02:40:20,580 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 147 transitions, 764 flow
[2024-03-09 02:40:20,952 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 147 transitions, 764 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:40:20,954 INFO  L231             Difference]: Finished difference. Result has 89 places, 139 transitions, 646 flow
[2024-03-09 02:40:20,954 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=89, PETRI_TRANSITIONS=139}
[2024-03-09 02:40:20,954 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places.
[2024-03-09 02:40:20,954 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 139 transitions, 646 flow
[2024-03-09 02:40:20,955 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)
[2024-03-09 02:40:20,955 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:40:20,955 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:40:20,955 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-09 02:40:20,955 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-09 02:40:20,956 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:40:20,956 INFO  L85        PathProgramCache]: Analyzing trace with hash 239957306, now seen corresponding path program 1 times
[2024-03-09 02:40:20,956 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:40:20,956 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636950782]
[2024-03-09 02:40:20,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:40:20,957 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:40:20,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:40:21,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:40:21,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:40:21,090 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636950782]
[2024-03-09 02:40:21,090 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636950782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:40:21,090 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:40:21,090 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:40:21,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056658299]
[2024-03-09 02:40:21,091 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:40:21,091 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:40:21,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:40:21,091 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:40:21,091 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:40:21,359 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 250
[2024-03-09 02:40:21,360 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 139 transitions, 646 flow. Second operand  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:21,360 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:40:21,360 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 250
[2024-03-09 02:40:21,360 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:40:31,552 INFO  L130       PetriNetUnfolder]: 78201/123586 cut-off events.
[2024-03-09 02:40:31,552 INFO  L131       PetriNetUnfolder]: For 94283/95509 co-relation queries the response was YES.
[2024-03-09 02:40:31,825 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 340505 conditions, 123586 events. 78201/123586 cut-off events. For 94283/95509 co-relation queries the response was YES. Maximal size of possible extension queue 2848. Compared 1012193 event pairs, 27187 based on Foata normal form. 0/117876 useless extension candidates. Maximal degree in co-relation 340493. Up to 88234 conditions per place. 
[2024-03-09 02:40:32,227 INFO  L137   encePairwiseOnDemand]: 231/250 looper letters, 148 selfloop transitions, 102 changer transitions 0/291 dead transitions.
[2024-03-09 02:40:32,227 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 291 transitions, 1807 flow
[2024-03-09 02:40:32,228 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:40:32,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:40:32,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 893 transitions.
[2024-03-09 02:40:32,229 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5953333333333334
[2024-03-09 02:40:32,229 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 893 transitions.
[2024-03-09 02:40:32,229 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 893 transitions.
[2024-03-09 02:40:32,230 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:40:32,230 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 893 transitions.
[2024-03-09 02:40:32,231 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:32,232 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:32,232 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:32,232 INFO  L175             Difference]: Start difference. First operand has 89 places, 139 transitions, 646 flow. Second operand 6 states and 893 transitions.
[2024-03-09 02:40:32,232 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 291 transitions, 1807 flow
[2024-03-09 02:40:32,316 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 291 transitions, 1807 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:40:32,319 INFO  L231             Difference]: Finished difference. Result has 99 places, 240 transitions, 1604 flow
[2024-03-09 02:40:32,319 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1604, PETRI_PLACES=99, PETRI_TRANSITIONS=240}
[2024-03-09 02:40:32,319 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places.
[2024-03-09 02:40:32,319 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 240 transitions, 1604 flow
[2024-03-09 02:40:32,320 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:32,320 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:40:32,320 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:40:32,320 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-03-09 02:40:32,320 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-09 02:40:32,320 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:40:32,320 INFO  L85        PathProgramCache]: Analyzing trace with hash 1459769595, now seen corresponding path program 1 times
[2024-03-09 02:40:32,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:40:32,321 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131356122]
[2024-03-09 02:40:32,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:40:32,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:40:32,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:40:32,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 02:40:32,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:40:32,471 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131356122]
[2024-03-09 02:40:32,471 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131356122] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:40:32,471 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:40:32,471 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:40:32,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619256889]
[2024-03-09 02:40:32,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:40:32,472 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:40:32,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:40:32,472 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:40:32,472 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:40:32,704 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 250
[2024-03-09 02:40:32,705 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 240 transitions, 1604 flow. Second operand  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:32,705 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:40:32,705 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 250
[2024-03-09 02:40:32,705 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:40:55,793 INFO  L130       PetriNetUnfolder]: 165587/252270 cut-off events.
[2024-03-09 02:40:55,793 INFO  L131       PetriNetUnfolder]: For 288404/291163 co-relation queries the response was YES.
[2024-03-09 02:40:56,514 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 817394 conditions, 252270 events. 165587/252270 cut-off events. For 288404/291163 co-relation queries the response was YES. Maximal size of possible extension queue 5144. Compared 2087744 event pairs, 47460 based on Foata normal form. 0/237884 useless extension candidates. Maximal degree in co-relation 817377. Up to 165386 conditions per place. 
[2024-03-09 02:40:57,470 INFO  L137   encePairwiseOnDemand]: 220/250 looper letters, 334 selfloop transitions, 162 changer transitions 0/517 dead transitions.
[2024-03-09 02:40:57,471 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 517 transitions, 4078 flow
[2024-03-09 02:40:57,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 02:40:57,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 02:40:57,472 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 918 transitions.
[2024-03-09 02:40:57,473 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.612
[2024-03-09 02:40:57,473 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 918 transitions.
[2024-03-09 02:40:57,473 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 918 transitions.
[2024-03-09 02:40:57,473 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:40:57,473 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 918 transitions.
[2024-03-09 02:40:57,474 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:57,475 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:57,476 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:57,476 INFO  L175             Difference]: Start difference. First operand has 99 places, 240 transitions, 1604 flow. Second operand 6 states and 918 transitions.
[2024-03-09 02:40:57,476 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 517 transitions, 4078 flow
[2024-03-09 02:40:58,769 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 517 transitions, 4078 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 02:40:58,774 INFO  L231             Difference]: Finished difference. Result has 108 places, 395 transitions, 3161 flow
[2024-03-09 02:40:58,774 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3161, PETRI_PLACES=108, PETRI_TRANSITIONS=395}
[2024-03-09 02:40:58,775 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 28 predicate places.
[2024-03-09 02:40:58,775 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 395 transitions, 3161 flow
[2024-03-09 02:40:58,775 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:58,775 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:40:58,775 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:40:58,776 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-09 02:40:58,776 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-09 02:40:58,776 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:40:58,776 INFO  L85        PathProgramCache]: Analyzing trace with hash 1725887645, now seen corresponding path program 1 times
[2024-03-09 02:40:58,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:40:58,776 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764708219]
[2024-03-09 02:40:58,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:40:58,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:40:58,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:40:58,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-09 02:40:58,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:40:58,962 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764708219]
[2024-03-09 02:40:58,963 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764708219] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 02:40:58,963 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707008032]
[2024-03-09 02:40:58,963 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:40:58,963 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 02:40:58,963 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 02:40:58,964 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 02:40:58,967 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-09 02:40:59,077 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:40:59,078 INFO  L263         TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core
[2024-03-09 02:40:59,080 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 02:40:59,147 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
[2024-03-09 02:40:59,173 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:40:59,174 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 21 treesize of output 20
[2024-03-09 02:40:59,208 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:40:59,210 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:40:59,210 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 02:40:59,371 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:40:59,372 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:40:59,373 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:40:59,374 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 02:40:59,424 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 02:40:59,425 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
[2024-03-09 02:40:59,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-09 02:40:59,467 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 02:40:59,494 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-09 02:40:59,528 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2024-03-09 02:40:59,551 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-03-09 02:40:59,574 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3 0) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1291 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_1291) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))) is different from false
[2024-03-09 02:40:59,592 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:40:59,593 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-09 02:40:59,598 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 02:40:59,598 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2024-03-09 02:40:59,602 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 7 treesize of output 3
[2024-03-09 02:40:59,610 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 02:40:59,610 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-09 02:40:59,614 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 02:40:59,614 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 02:40:59,618 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 02:40:59,619 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 02:40:59,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked.
[2024-03-09 02:40:59,641 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [707008032] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 02:40:59,641 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 02:40:59,641 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16
[2024-03-09 02:40:59,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578724321]
[2024-03-09 02:40:59,641 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 02:40:59,642 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-03-09 02:40:59,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:40:59,642 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-03-09 02:40:59,642 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=122, Unknown=4, NotChecked=108, Total=306
[2024-03-09 02:40:59,694 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 250
[2024-03-09 02:40:59,696 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 395 transitions, 3161 flow. Second operand  has 18 states, 18 states have (on average 95.33333333333333) internal successors, (1716), 18 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:40:59,696 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:40:59,696 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 250
[2024-03-09 02:40:59,696 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:41:44,101 INFO  L130       PetriNetUnfolder]: 291944/413535 cut-off events.
[2024-03-09 02:41:44,102 INFO  L131       PetriNetUnfolder]: For 908915/908915 co-relation queries the response was YES.
[2024-03-09 02:41:45,475 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1581109 conditions, 413535 events. 291944/413535 cut-off events. For 908915/908915 co-relation queries the response was YES. Maximal size of possible extension queue 6772. Compared 3087121 event pairs, 146441 based on Foata normal form. 6822/389899 useless extension candidates. Maximal degree in co-relation 1581087. Up to 397760 conditions per place. 
[2024-03-09 02:41:47,147 INFO  L137   encePairwiseOnDemand]: 233/250 looper letters, 440 selfloop transitions, 7 changer transitions 11/464 dead transitions.
[2024-03-09 02:41:47,148 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 464 transitions, 4550 flow
[2024-03-09 02:41:47,149 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-09 02:41:47,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-09 02:41:47,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 760 transitions.
[2024-03-09 02:41:47,151 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4342857142857143
[2024-03-09 02:41:47,151 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 760 transitions.
[2024-03-09 02:41:47,152 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 760 transitions.
[2024-03-09 02:41:47,152 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:41:47,152 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 760 transitions.
[2024-03-09 02:41:47,154 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:41:47,157 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:41:47,158 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:41:47,158 INFO  L175             Difference]: Start difference. First operand has 108 places, 395 transitions, 3161 flow. Second operand 7 states and 760 transitions.
[2024-03-09 02:41:47,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 464 transitions, 4550 flow
[2024-03-09 02:42:19,631 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 464 transitions, 4454 flow, removed 48 selfloop flow, removed 0 redundant places.
[2024-03-09 02:42:19,636 INFO  L231             Difference]: Finished difference. Result has 115 places, 396 transitions, 3125 flow
[2024-03-09 02:42:19,637 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=3053, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3125, PETRI_PLACES=115, PETRI_TRANSITIONS=396}
[2024-03-09 02:42:19,637 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 35 predicate places.
[2024-03-09 02:42:19,637 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 396 transitions, 3125 flow
[2024-03-09 02:42:19,637 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 95.33333333333333) internal successors, (1716), 18 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:42:19,638 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:42:19,638 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:42:19,645 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-09 02:42:19,838 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2024-03-09 02:42:19,839 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-09 02:42:19,839 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:42:19,839 INFO  L85        PathProgramCache]: Analyzing trace with hash -742669094, now seen corresponding path program 1 times
[2024-03-09 02:42:19,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:42:19,840 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911123471]
[2024-03-09 02:42:19,840 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:42:19,840 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:42:19,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:42:20,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-09 02:42:20,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:42:20,073 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911123471]
[2024-03-09 02:42:20,073 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911123471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:42:20,073 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:42:20,073 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-03-09 02:42:20,074 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608844357]
[2024-03-09 02:42:20,074 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:42:20,074 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-09 02:42:20,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:42:20,075 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-09 02:42:20,075 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-03-09 02:42:20,453 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250
[2024-03-09 02:42:20,454 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 396 transitions, 3125 flow. Second operand  has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:42:20,454 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:42:20,454 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250
[2024-03-09 02:42:20,455 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 02:42:59,119 INFO  L130       PetriNetUnfolder]: 228393/343096 cut-off events.
[2024-03-09 02:42:59,119 INFO  L131       PetriNetUnfolder]: For 759203/760402 co-relation queries the response was YES.
[2024-03-09 02:43:00,575 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1360103 conditions, 343096 events. 228393/343096 cut-off events. For 759203/760402 co-relation queries the response was YES. Maximal size of possible extension queue 7509. Compared 2877684 event pairs, 59819 based on Foata normal form. 3244/340102 useless extension candidates. Maximal degree in co-relation 1360076. Up to 157988 conditions per place. 
[2024-03-09 02:43:02,241 INFO  L137   encePairwiseOnDemand]: 230/250 looper letters, 593 selfloop transitions, 254 changer transitions 0/865 dead transitions.
[2024-03-09 02:43:02,242 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 865 transitions, 8001 flow
[2024-03-09 02:43:02,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-09 02:43:02,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-09 02:43:02,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1158 transitions.
[2024-03-09 02:43:02,244 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.579
[2024-03-09 02:43:02,244 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1158 transitions.
[2024-03-09 02:43:02,244 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1158 transitions.
[2024-03-09 02:43:02,244 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 02:43:02,244 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1158 transitions.
[2024-03-09 02:43:02,246 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 144.75) internal successors, (1158), 8 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:43:02,247 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:43:02,247 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:43:02,247 INFO  L175             Difference]: Start difference. First operand has 115 places, 396 transitions, 3125 flow. Second operand 8 states and 1158 transitions.
[2024-03-09 02:43:02,248 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 865 transitions, 8001 flow
[2024-03-09 02:43:37,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 865 transitions, 7917 flow, removed 31 selfloop flow, removed 2 redundant places.
[2024-03-09 02:43:37,823 INFO  L231             Difference]: Finished difference. Result has 126 places, 588 transitions, 5772 flow
[2024-03-09 02:43:37,823 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=3105, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5772, PETRI_PLACES=126, PETRI_TRANSITIONS=588}
[2024-03-09 02:43:37,824 INFO  L288   CegarLoopForPetriNet]: 80 programPoint places, 46 predicate places.
[2024-03-09 02:43:37,824 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 588 transitions, 5772 flow
[2024-03-09 02:43:37,824 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:43:37,824 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 02:43:37,824 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 02:43:37,825 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-09 02:43:37,825 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-09 02:43:37,825 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 02:43:37,825 INFO  L85        PathProgramCache]: Analyzing trace with hash -1032540666, now seen corresponding path program 1 times
[2024-03-09 02:43:37,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 02:43:37,825 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998078862]
[2024-03-09 02:43:37,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 02:43:37,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 02:43:37,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 02:43:37,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-03-09 02:43:37,983 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 02:43:37,984 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998078862]
[2024-03-09 02:43:37,984 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998078862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 02:43:37,984 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 02:43:37,984 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 02:43:37,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694014080]
[2024-03-09 02:43:37,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 02:43:37,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 02:43:37,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 02:43:37,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 02:43:37,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 02:43:38,199 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 250
[2024-03-09 02:43:38,200 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 588 transitions, 5772 flow. Second operand  has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 02:43:38,200 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 02:43:38,200 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 250
[2024-03-09 02:43:38,200 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
