./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-ptr.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-ptr.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 c8d964de1f9939284b07a303cd6738f27ad6151a08cde6c6c589697ec126ba86
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-01 16:34:41,037 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-01 16:34:41,039 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-01 16:34:41,060 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-01 16:34:41,061 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-01 16:34:41,062 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-01 16:34:41,062 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-01 16:34:41,064 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-01 16:34:41,065 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-01 16:34:41,065 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-01 16:34:41,066 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-01 16:34:41,067 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-01 16:34:41,067 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-01 16:34:41,068 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-01 16:34:41,068 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-01 16:34:41,069 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-01 16:34:41,070 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-01 16:34:41,070 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-01 16:34:41,071 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-01 16:34:41,073 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-01 16:34:41,074 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-01 16:34:41,075 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-01 16:34:41,080 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-01 16:34:41,081 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-01 16:34:41,085 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-01 16:34:41,086 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-01 16:34:41,086 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-01 16:34:41,087 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-01 16:34:41,087 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-01 16:34:41,088 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-01 16:34:41,089 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-01 16:34:41,089 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-01 16:34:41,090 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-01 16:34:41,091 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-01 16:34:41,092 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-01 16:34:41,092 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-01 16:34:41,093 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-01 16:34:41,093 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-01 16:34:41,093 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-01 16:34:41,094 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-01 16:34:41,094 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-01 16:34:41,095 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-01 16:34:41,123 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-01 16:34:41,123 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-01 16:34:41,123 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-01 16:34:41,123 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-01 16:34:41,124 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-01 16:34:41,124 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-01 16:34:41,124 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-01 16:34:41,124 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-01 16:34:41,124 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-01 16:34:41,125 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-01 16:34:41,125 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-01 16:34:41,125 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-01 16:34:41,125 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-01 16:34:41,125 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-01 16:34:41,125 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-01 16:34:41,125 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-01 16:34:41,125 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-01 16:34:41,125 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-01 16:34:41,126 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-01 16:34:41,126 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-01 16:34:41,126 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-01 16:34:41,126 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-01 16:34:41,126 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-01 16:34:41,126 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-01 16:34:41,126 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-01 16:34:41,126 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-01 16:34:41,126 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 16:34:41,127 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-01 16:34:41,127 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-01 16:34:41,127 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-01 16:34:41,127 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-01 16:34:41,127 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-01 16:34:41,127 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-01 16:34:41,127 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-01 16:34:41,127 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-01 16:34:41,127 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-01 16:34:41,127 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-01 16:34:41,128 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 -> c8d964de1f9939284b07a303cd6738f27ad6151a08cde6c6c589697ec126ba86
[2023-11-01 16:34:41,301 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-01 16:34:41,324 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-01 16:34:41,326 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-01 16:34:41,327 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-01 16:34:41,327 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-01 16:34:41,328 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2023-11-01 16:34:42,332 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-01 16:34:42,525 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-01 16:34:42,525 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr.i
[2023-11-01 16:34:42,537 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/2dfb23025/8e9ea09994e1450bb18da81aac5d5cb9/FLAG034c0098a
[2023-11-01 16:34:42,887 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/2dfb23025/8e9ea09994e1450bb18da81aac5d5cb9
[2023-11-01 16:34:42,889 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-01 16:34:42,891 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-01 16:34:42,891 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-01 16:34:42,892 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-01 16:34:42,895 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-01 16:34:42,895 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:34:42" (1/1) ...
[2023-11-01 16:34:42,896 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4205784f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:42, skipping insertion in model container
[2023-11-01 16:34:42,896 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 04:34:42" (1/1) ...
[2023-11-01 16:34:42,902 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-01 16:34:42,933 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-01 16:34:43,056 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-01 16:34:43,235 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 16:34:43,241 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-01 16:34:43,252 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-01 16:34:43,278 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-01 16:34:43,314 INFO  L208         MainTranslator]: Completed translation
[2023-11-01 16:34:43,315 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43 WrapperNode
[2023-11-01 16:34:43,315 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-01 16:34:43,316 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-01 16:34:43,316 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-01 16:34:43,316 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-01 16:34:43,322 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (1/1) ...
[2023-11-01 16:34:43,338 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (1/1) ...
[2023-11-01 16:34:43,359 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2023-11-01 16:34:43,360 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-01 16:34:43,360 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-01 16:34:43,360 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-01 16:34:43,360 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-01 16:34:43,368 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (1/1) ...
[2023-11-01 16:34:43,368 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (1/1) ...
[2023-11-01 16:34:43,372 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (1/1) ...
[2023-11-01 16:34:43,372 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (1/1) ...
[2023-11-01 16:34:43,381 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (1/1) ...
[2023-11-01 16:34:43,384 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (1/1) ...
[2023-11-01 16:34:43,385 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (1/1) ...
[2023-11-01 16:34:43,387 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (1/1) ...
[2023-11-01 16:34:43,389 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-01 16:34:43,390 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-01 16:34:43,390 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-01 16:34:43,390 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-01 16:34:43,391 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (1/1) ...
[2023-11-01 16:34:43,404 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-01 16:34:43,413 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:34:43,425 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-01 16:34:43,427 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-01 16:34:43,463 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-01 16:34:43,463 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-01 16:34:43,464 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-01 16:34:43,464 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-01 16:34:43,464 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-01 16:34:43,464 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-01 16:34:43,464 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-01 16:34:43,465 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-01 16:34:43,465 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-01 16:34:43,465 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-01 16:34:43,465 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-01 16:34:43,467 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-01 16:34:43,584 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-01 16:34:43,586 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-01 16:34:43,800 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-01 16:34:43,807 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-01 16:34:43,807 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-01 16:34:43,809 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:34:43 BoogieIcfgContainer
[2023-11-01 16:34:43,809 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-01 16:34:43,811 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-01 16:34:43,811 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-01 16:34:43,814 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-01 16:34:43,814 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 04:34:42" (1/3) ...
[2023-11-01 16:34:43,815 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75329b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:34:43, skipping insertion in model container
[2023-11-01 16:34:43,815 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 04:34:43" (2/3) ...
[2023-11-01 16:34:43,815 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75329b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 04:34:43, skipping insertion in model container
[2023-11-01 16:34:43,815 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 04:34:43" (3/3) ...
[2023-11-01 16:34:43,816 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr.i
[2023-11-01 16:34:43,823 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-01 16:34:43,831 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-01 16:34:43,831 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2023-11-01 16:34:43,831 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-01 16:34:43,876 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-01 16:34:43,904 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-11-01 16:34:43,958 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-11-01 16:34:43,959 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 16:34:43,963 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-11-01 16:34:43,963 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2023-11-01 16:34:43,967 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2023-11-01 16:34:43,969 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 16:34:43,977 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2023-11-01 16:34:43,979 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2023-11-01 16:34:43,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2023-11-01 16:34:44,008 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2023-11-01 16:34:44,008 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-01 16:34:44,009 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 364 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2023-11-01 16:34:44,010 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2023-11-01 16:34:46,410 INFO  L134        LiptonReduction]: Checked pairs total: 9489
[2023-11-01 16:34:46,410 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2023-11-01 16:34:46,422 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 16:34:46,428 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;@3c0bdcf0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 16:34:46,428 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-11-01 16:34:46,431 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-11-01 16:34:46,431 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 16:34:46,431 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:34:46,432 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:34:46,432 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-01 16:34:46,436 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:34:46,436 INFO  L85        PathProgramCache]: Analyzing trace with hash 1980212676, now seen corresponding path program 1 times
[2023-11-01 16:34:46,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:34:46,443 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782925414]
[2023-11-01 16:34:46,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:46,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:34:46,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:46,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:46,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:34:46,861 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782925414]
[2023-11-01 16:34:46,862 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782925414] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:34:46,862 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:34:46,862 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:34:46,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544090172]
[2023-11-01 16:34:46,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:34:46,870 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:34:46,871 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:34:46,889 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:34:46,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:34:47,181 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 197
[2023-11-01 16:34:47,184 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:47,184 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:34:47,184 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 197
[2023-11-01 16:34:47,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:34:47,393 INFO  L130       PetriNetUnfolder]: 146/507 cut-off events.
[2023-11-01 16:34:47,394 INFO  L131       PetriNetUnfolder]: For 4/8 co-relation queries the response was YES.
[2023-11-01 16:34:47,396 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 870 conditions, 507 events. 146/507 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2712 event pairs, 42 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 784. Up to 226 conditions per place. 
[2023-11-01 16:34:47,400 INFO  L137   encePairwiseOnDemand]: 181/197 looper letters, 47 selfloop transitions, 23 changer transitions 0/98 dead transitions.
[2023-11-01 16:34:47,400 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 344 flow
[2023-11-01 16:34:47,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:34:47,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:34:47,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions.
[2023-11-01 16:34:47,414 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5583756345177665
[2023-11-01 16:34:47,415 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 660 transitions.
[2023-11-01 16:34:47,415 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 660 transitions.
[2023-11-01 16:34:47,417 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:34:47,419 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 660 transitions.
[2023-11-01 16:34:47,424 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 110.0) internal successors, (660), 6 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)
[2023-11-01 16:34:47,434 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:47,435 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:47,436 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 660 transitions.
[2023-11-01 16:34:47,437 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 344 flow
[2023-11-01 16:34:47,440 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 344 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:34:47,442 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2023-11-01 16:34:47,444 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2023-11-01 16:34:47,446 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2023-11-01 16:34:47,446 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2023-11-01 16:34:47,447 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:47,447 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:34:47,447 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:34:47,448 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-01 16:34:47,448 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-01 16:34:47,448 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:34:47,448 INFO  L85        PathProgramCache]: Analyzing trace with hash 1641346575, now seen corresponding path program 1 times
[2023-11-01 16:34:47,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:34:47,449 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456537355]
[2023-11-01 16:34:47,449 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:47,449 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:34:47,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:47,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:47,638 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:34:47,638 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456537355]
[2023-11-01 16:34:47,638 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456537355] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:34:47,638 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:34:47,638 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:34:47,638 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32845779]
[2023-11-01 16:34:47,639 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:34:47,639 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:34:47,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:34:47,640 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:34:47,640 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:34:47,893 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 197
[2023-11-01 16:34:47,894 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 292 flow. Second operand  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:47,894 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:34:47,895 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 197
[2023-11-01 16:34:47,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:34:48,163 INFO  L130       PetriNetUnfolder]: 284/850 cut-off events.
[2023-11-01 16:34:48,163 INFO  L131       PetriNetUnfolder]: For 332/338 co-relation queries the response was YES.
[2023-11-01 16:34:48,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 850 events. 284/850 cut-off events. For 332/338 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5116 event pairs, 51 based on Foata normal form. 5/813 useless extension candidates. Maximal degree in co-relation 1873. Up to 398 conditions per place. 
[2023-11-01 16:34:48,172 INFO  L137   encePairwiseOnDemand]: 174/197 looper letters, 73 selfloop transitions, 50 changer transitions 0/152 dead transitions.
[2023-11-01 16:34:48,172 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 152 transitions, 799 flow
[2023-11-01 16:34:48,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:34:48,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:34:48,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions.
[2023-11-01 16:34:48,176 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5439932318104906
[2023-11-01 16:34:48,176 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 643 transitions.
[2023-11-01 16:34:48,176 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions.
[2023-11-01 16:34:48,176 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:34:48,176 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions.
[2023-11-01 16:34:48,178 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:48,180 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:48,181 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:48,181 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 6 states and 643 transitions.
[2023-11-01 16:34:48,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 152 transitions, 799 flow
[2023-11-01 16:34:48,185 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 152 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:34:48,187 INFO  L231             Difference]: Finished difference. Result has 79 places, 129 transitions, 770 flow
[2023-11-01 16:34:48,187 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=770, PETRI_PLACES=79, PETRI_TRANSITIONS=129}
[2023-11-01 16:34:48,188 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places.
[2023-11-01 16:34:48,188 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 129 transitions, 770 flow
[2023-11-01 16:34:48,189 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:48,189 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:34:48,189 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:34:48,189 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-01 16:34:48,189 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-01 16:34:48,189 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:34:48,190 INFO  L85        PathProgramCache]: Analyzing trace with hash 61135557, now seen corresponding path program 1 times
[2023-11-01 16:34:48,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:34:48,190 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626153481]
[2023-11-01 16:34:48,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:48,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:34:48,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:48,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:48,403 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:34:48,403 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626153481]
[2023-11-01 16:34:48,403 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626153481] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:34:48,404 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:34:48,404 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:34:48,404 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769996819]
[2023-11-01 16:34:48,404 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:34:48,404 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:34:48,404 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:34:48,405 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:34:48,405 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:34:48,672 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197
[2023-11-01 16:34:48,673 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 129 transitions, 770 flow. Second operand  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:48,673 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:34:48,673 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197
[2023-11-01 16:34:48,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:34:48,855 INFO  L130       PetriNetUnfolder]: 280/858 cut-off events.
[2023-11-01 16:34:48,855 INFO  L131       PetriNetUnfolder]: For 1118/1126 co-relation queries the response was YES.
[2023-11-01 16:34:48,857 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 858 events. 280/858 cut-off events. For 1118/1126 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5295 event pairs, 47 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 2418. Up to 429 conditions per place. 
[2023-11-01 16:34:48,860 INFO  L137   encePairwiseOnDemand]: 186/197 looper letters, 76 selfloop transitions, 33 changer transitions 8/171 dead transitions.
[2023-11-01 16:34:48,860 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 171 transitions, 1243 flow
[2023-11-01 16:34:48,861 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:34:48,861 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:34:48,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions.
[2023-11-01 16:34:48,862 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5651438240270727
[2023-11-01 16:34:48,862 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 668 transitions.
[2023-11-01 16:34:48,863 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions.
[2023-11-01 16:34:48,863 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:34:48,863 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions.
[2023-11-01 16:34:48,865 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:48,867 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:48,868 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:48,868 INFO  L175             Difference]: Start difference. First operand has 79 places, 129 transitions, 770 flow. Second operand 6 states and 668 transitions.
[2023-11-01 16:34:48,868 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 171 transitions, 1243 flow
[2023-11-01 16:34:48,872 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 171 transitions, 1243 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:34:48,874 INFO  L231             Difference]: Finished difference. Result has 89 places, 159 transitions, 1135 flow
[2023-11-01 16:34:48,875 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1135, PETRI_PLACES=89, PETRI_TRANSITIONS=159}
[2023-11-01 16:34:48,875 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2023-11-01 16:34:48,875 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 159 transitions, 1135 flow
[2023-11-01 16:34:48,876 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:48,876 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:34:48,876 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]
[2023-11-01 16:34:48,876 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-01 16:34:48,876 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-01 16:34:48,877 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:34:48,877 INFO  L85        PathProgramCache]: Analyzing trace with hash -1282532369, now seen corresponding path program 1 times
[2023-11-01 16:34:48,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:34:48,877 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457718365]
[2023-11-01 16:34:48,877 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:48,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:34:48,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:49,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:49,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:34:49,090 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457718365]
[2023-11-01 16:34:49,090 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457718365] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:34:49,091 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:34:49,091 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:34:49,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146077044]
[2023-11-01 16:34:49,091 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:34:49,091 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:34:49,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:34:49,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:34:49,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:34:49,193 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197
[2023-11-01 16:34:49,194 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 159 transitions, 1135 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)
[2023-11-01 16:34:49,194 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:34:49,194 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197
[2023-11-01 16:34:49,194 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:34:49,679 INFO  L130       PetriNetUnfolder]: 536/1340 cut-off events.
[2023-11-01 16:34:49,680 INFO  L131       PetriNetUnfolder]: For 1846/1860 co-relation queries the response was YES.
[2023-11-01 16:34:49,682 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4866 conditions, 1340 events. 536/1340 cut-off events. For 1846/1860 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8489 event pairs, 92 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 4685. Up to 994 conditions per place. 
[2023-11-01 16:34:49,688 INFO  L137   encePairwiseOnDemand]: 167/197 looper letters, 167 selfloop transitions, 111 changer transitions 10/304 dead transitions.
[2023-11-01 16:34:49,688 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 304 transitions, 2365 flow
[2023-11-01 16:34:49,689 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:34:49,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:34:49,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 683 transitions.
[2023-11-01 16:34:49,690 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.577834179357022
[2023-11-01 16:34:49,691 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 683 transitions.
[2023-11-01 16:34:49,691 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 683 transitions.
[2023-11-01 16:34:49,691 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:34:49,691 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 683 transitions.
[2023-11-01 16:34:49,693 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:49,694 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:49,695 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:49,695 INFO  L175             Difference]: Start difference. First operand has 89 places, 159 transitions, 1135 flow. Second operand 6 states and 683 transitions.
[2023-11-01 16:34:49,695 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 304 transitions, 2365 flow
[2023-11-01 16:34:49,702 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 304 transitions, 2365 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:34:49,706 INFO  L231             Difference]: Finished difference. Result has 97 places, 262 transitions, 2045 flow
[2023-11-01 16:34:49,706 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2045, PETRI_PLACES=97, PETRI_TRANSITIONS=262}
[2023-11-01 16:34:49,707 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 38 predicate places.
[2023-11-01 16:34:49,707 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 262 transitions, 2045 flow
[2023-11-01 16:34:49,707 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)
[2023-11-01 16:34:49,707 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:34:49,708 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:34:49,708 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-01 16:34:49,708 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-01 16:34:49,708 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:34:49,708 INFO  L85        PathProgramCache]: Analyzing trace with hash 1889096930, now seen corresponding path program 1 times
[2023-11-01 16:34:49,708 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:34:49,708 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999786251]
[2023-11-01 16:34:49,709 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:49,709 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:34:49,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:50,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:50,092 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:34:50,092 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999786251]
[2023-11-01 16:34:50,092 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999786251] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:34:50,093 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418309778]
[2023-11-01 16:34:50,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:50,093 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:34:50,093 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:34:50,095 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)
[2023-11-01 16:34:50,098 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
[2023-11-01 16:34:50,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:50,193 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-11-01 16:34:50,214 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:34:50,280 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 17 treesize of output 9
[2023-11-01 16:34:50,406 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:34:50,436 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:34:50,437 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
[2023-11-01 16:34:50,470 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:34:50,471 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:34:50,472 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
[2023-11-01 16:34:50,515 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:34:50,516 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:34:50,517 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:34:50,518 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
[2023-11-01 16:34:50,561 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:34:50,562 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:34:50,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:50,591 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:34:50,619 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0))) is different from false
[2023-11-01 16:34:50,643 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_237 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_237) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0))))) is different from false
[2023-11-01 16:34:50,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 16:34:50,785 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [418309778] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:34:50,785 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:34:50,785 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-11-01 16:34:50,785 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369470610]
[2023-11-01 16:34:50,785 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:34:50,786 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-01 16:34:50,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:34:50,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-01 16:34:50,787 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=459, Unknown=2, NotChecked=90, Total=650
[2023-11-01 16:34:50,880 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 197
[2023-11-01 16:34:50,881 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 262 transitions, 2045 flow. Second operand  has 26 states, 26 states have (on average 61.57692307692308) internal successors, (1601), 26 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:50,882 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:34:50,882 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 197
[2023-11-01 16:34:50,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:34:51,771 INFO  L130       PetriNetUnfolder]: 631/1461 cut-off events.
[2023-11-01 16:34:51,771 INFO  L131       PetriNetUnfolder]: For 3916/3922 co-relation queries the response was YES.
[2023-11-01 16:34:51,774 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6505 conditions, 1461 events. 631/1461 cut-off events. For 3916/3922 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9098 event pairs, 154 based on Foata normal form. 10/1371 useless extension candidates. Maximal degree in co-relation 6378. Up to 1331 conditions per place. 
[2023-11-01 16:34:51,779 INFO  L137   encePairwiseOnDemand]: 187/197 looper letters, 304 selfloop transitions, 12 changer transitions 12/330 dead transitions.
[2023-11-01 16:34:51,779 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 330 transitions, 3086 flow
[2023-11-01 16:34:51,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-11-01 16:34:51,780 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-11-01 16:34:51,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2023-11-01 16:34:51,782 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3598984771573604
[2023-11-01 16:34:51,782 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2023-11-01 16:34:51,782 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2023-11-01 16:34:51,783 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:34:51,783 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2023-11-01 16:34:51,784 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 70.9) internal successors, (709), 10 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:51,786 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:51,787 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:51,787 INFO  L175             Difference]: Start difference. First operand has 97 places, 262 transitions, 2045 flow. Second operand 10 states and 709 transitions.
[2023-11-01 16:34:51,787 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 330 transitions, 3086 flow
[2023-11-01 16:34:51,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 330 transitions, 2942 flow, removed 72 selfloop flow, removed 0 redundant places.
[2023-11-01 16:34:51,806 INFO  L231             Difference]: Finished difference. Result has 107 places, 265 transitions, 1941 flow
[2023-11-01 16:34:51,807 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1941, PETRI_PLACES=107, PETRI_TRANSITIONS=265}
[2023-11-01 16:34:51,807 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 48 predicate places.
[2023-11-01 16:34:51,807 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 265 transitions, 1941 flow
[2023-11-01 16:34:51,808 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 61.57692307692308) internal successors, (1601), 26 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:51,808 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:34:51,808 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:34:51,818 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
[2023-11-01 16:34:52,009 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:34:52,014 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-01 16:34:52,015 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:34:52,015 INFO  L85        PathProgramCache]: Analyzing trace with hash 109794428, now seen corresponding path program 1 times
[2023-11-01 16:34:52,016 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:34:52,016 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51628963]
[2023-11-01 16:34:52,016 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:52,016 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:34:52,033 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:52,320 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:52,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:34:52,321 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51628963]
[2023-11-01 16:34:52,321 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51628963] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:34:52,321 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391171207]
[2023-11-01 16:34:52,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:52,321 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:34:52,321 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:34:52,322 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)
[2023-11-01 16:34:52,324 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
[2023-11-01 16:34:52,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:52,419 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 28 conjunts are in the unsatisfiable core
[2023-11-01 16:34:52,423 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:34:52,441 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 17 treesize of output 9
[2023-11-01 16:34:52,498 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:34:52,522 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:34:52,556 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:34:52,556 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:34:52,593 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:34:52,594 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:34:52,650 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:34:52,651 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:34:52,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:52,659 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:34:52,682 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-11-01 16:34:52,730 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:34:52,752 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_350 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_350) c_threadThread1of1ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-11-01 16:34:52,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-11-01 16:34:52,832 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391171207] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:34:52,832 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:34:52,832 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21
[2023-11-01 16:34:52,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931584673]
[2023-11-01 16:34:52,833 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:34:52,833 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2023-11-01 16:34:52,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:34:52,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2023-11-01 16:34:52,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=304, Unknown=3, NotChecked=114, Total=506
[2023-11-01 16:34:52,939 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 197
[2023-11-01 16:34:52,940 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 265 transitions, 1941 flow. Second operand  has 23 states, 23 states have (on average 59.869565217391305) internal successors, (1377), 23 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:52,940 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:34:52,941 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 197
[2023-11-01 16:34:52,941 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:34:55,778 INFO  L130       PetriNetUnfolder]: 720/1653 cut-off events.
[2023-11-01 16:34:55,779 INFO  L131       PetriNetUnfolder]: For 3859/3865 co-relation queries the response was YES.
[2023-11-01 16:34:55,784 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7496 conditions, 1653 events. 720/1653 cut-off events. For 3859/3865 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10567 event pairs, 75 based on Foata normal form. 2/1572 useless extension candidates. Maximal degree in co-relation 7351. Up to 979 conditions per place. 
[2023-11-01 16:34:55,792 INFO  L137   encePairwiseOnDemand]: 146/197 looper letters, 279 selfloop transitions, 236 changer transitions 41/558 dead transitions.
[2023-11-01 16:34:55,792 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 558 transitions, 4800 flow
[2023-11-01 16:34:55,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-11-01 16:34:55,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-11-01 16:34:55,796 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1554 transitions.
[2023-11-01 16:34:55,796 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3756345177664975
[2023-11-01 16:34:55,796 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1554 transitions.
[2023-11-01 16:34:55,797 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1554 transitions.
[2023-11-01 16:34:55,797 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:34:55,798 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1554 transitions.
[2023-11-01 16:34:55,800 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 74.0) internal successors, (1554), 21 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:55,805 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:55,807 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:55,807 INFO  L175             Difference]: Start difference. First operand has 107 places, 265 transitions, 1941 flow. Second operand 21 states and 1554 transitions.
[2023-11-01 16:34:55,807 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 558 transitions, 4800 flow
[2023-11-01 16:34:55,842 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 558 transitions, 4770 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-01 16:34:55,848 INFO  L231             Difference]: Finished difference. Result has 131 places, 395 transitions, 3786 flow
[2023-11-01 16:34:55,848 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3786, PETRI_PLACES=131, PETRI_TRANSITIONS=395}
[2023-11-01 16:34:55,849 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 72 predicate places.
[2023-11-01 16:34:55,849 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 395 transitions, 3786 flow
[2023-11-01 16:34:55,849 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 59.869565217391305) internal successors, (1377), 23 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:55,850 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:34:55,850 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]
[2023-11-01 16:34:55,857 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
[2023-11-01 16:34:56,050 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:34:56,054 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-01 16:34:56,055 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:34:56,055 INFO  L85        PathProgramCache]: Analyzing trace with hash -2068764240, now seen corresponding path program 1 times
[2023-11-01 16:34:56,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:34:56,056 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585554820]
[2023-11-01 16:34:56,056 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:56,056 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:34:56,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:56,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:56,135 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:34:56,135 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585554820]
[2023-11-01 16:34:56,135 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585554820] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:34:56,136 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092515263]
[2023-11-01 16:34:56,136 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:56,136 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:34:56,136 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:34:56,137 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)
[2023-11-01 16:34:56,138 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
[2023-11-01 16:34:56,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:56,245 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-01 16:34:56,246 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:34:56,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:56,281 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:34:56,313 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:56,313 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092515263] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:34:56,313 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:34:56,314 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-11-01 16:34:56,314 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277235518]
[2023-11-01 16:34:56,314 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:34:56,314 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-01 16:34:56,315 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:34:56,315 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-01 16:34:56,315 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-11-01 16:34:56,408 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197
[2023-11-01 16:34:56,409 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 395 transitions, 3786 flow. Second operand  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:56,409 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:34:56,410 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197
[2023-11-01 16:34:56,410 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:34:56,619 INFO  L130       PetriNetUnfolder]: 322/901 cut-off events.
[2023-11-01 16:34:56,619 INFO  L131       PetriNetUnfolder]: For 3755/3789 co-relation queries the response was YES.
[2023-11-01 16:34:56,621 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4681 conditions, 901 events. 322/901 cut-off events. For 3755/3789 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5583 event pairs, 11 based on Foata normal form. 16/905 useless extension candidates. Maximal degree in co-relation 4536. Up to 295 conditions per place. 
[2023-11-01 16:34:56,625 INFO  L137   encePairwiseOnDemand]: 191/197 looper letters, 31 selfloop transitions, 12 changer transitions 3/294 dead transitions.
[2023-11-01 16:34:56,625 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 294 transitions, 2894 flow
[2023-11-01 16:34:56,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-01 16:34:56,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-01 16:34:56,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 770 transitions.
[2023-11-01 16:34:56,628 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5583756345177665
[2023-11-01 16:34:56,628 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 770 transitions.
[2023-11-01 16:34:56,628 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 770 transitions.
[2023-11-01 16:34:56,628 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:34:56,629 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 770 transitions.
[2023-11-01 16:34:56,630 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 110.0) internal successors, (770), 7 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)
[2023-11-01 16:34:56,631 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:56,632 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:56,632 INFO  L175             Difference]: Start difference. First operand has 131 places, 395 transitions, 3786 flow. Second operand 7 states and 770 transitions.
[2023-11-01 16:34:56,632 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 294 transitions, 2894 flow
[2023-11-01 16:34:56,651 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 294 transitions, 2722 flow, removed 63 selfloop flow, removed 8 redundant places.
[2023-11-01 16:34:56,654 INFO  L231             Difference]: Finished difference. Result has 117 places, 286 transitions, 2600 flow
[2023-11-01 16:34:56,654 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2600, PETRI_PLACES=117, PETRI_TRANSITIONS=286}
[2023-11-01 16:34:56,655 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 58 predicate places.
[2023-11-01 16:34:56,655 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 286 transitions, 2600 flow
[2023-11-01 16:34:56,656 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:56,656 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:34:56,656 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]
[2023-11-01 16:34:56,664 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2023-11-01 16:34:56,856 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:34:56,857 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-01 16:34:56,857 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:34:56,857 INFO  L85        PathProgramCache]: Analyzing trace with hash 2139930529, now seen corresponding path program 1 times
[2023-11-01 16:34:56,857 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:34:56,858 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220453206]
[2023-11-01 16:34:56,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:56,858 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:34:56,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:57,147 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:57,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:34:57,148 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220453206]
[2023-11-01 16:34:57,148 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220453206] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:34:57,148 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39558646]
[2023-11-01 16:34:57,148 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:34:57,148 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:34:57,148 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:34:57,150 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)
[2023-11-01 16:34:57,151 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
[2023-11-01 16:34:57,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:34:57,269 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-11-01 16:34:57,272 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:34:57,309 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 17 treesize of output 9
[2023-11-01 16:34:57,372 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:34:57,406 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:34:57,440 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:34:57,441 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:34:57,486 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:34:57,486 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:34:57,528 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:34:57,529 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:34:57,539 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:57,539 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:34:57,559 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) is different from false
[2023-11-01 16:34:57,576 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:34:57,596 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_567 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_567 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_567) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:34:57,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:34:57,718 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [39558646] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:34:57,718 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:34:57,718 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-11-01 16:34:57,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834541320]
[2023-11-01 16:34:57,718 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:34:57,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-01 16:34:57,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:34:57,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-01 16:34:57,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-11-01 16:34:57,752 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 197
[2023-11-01 16:34:57,753 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 286 transitions, 2600 flow. Second operand  has 26 states, 26 states have (on average 56.65384615384615) internal successors, (1473), 26 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:57,753 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:34:57,753 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 197
[2023-11-01 16:34:57,753 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:34:59,938 INFO  L130       PetriNetUnfolder]: 532/1249 cut-off events.
[2023-11-01 16:34:59,939 INFO  L131       PetriNetUnfolder]: For 5011/5011 co-relation queries the response was YES.
[2023-11-01 16:34:59,942 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6797 conditions, 1249 events. 532/1249 cut-off events. For 5011/5011 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7590 event pairs, 30 based on Foata normal form. 43/1292 useless extension candidates. Maximal degree in co-relation 6640. Up to 666 conditions per place. 
[2023-11-01 16:34:59,947 INFO  L137   encePairwiseOnDemand]: 160/197 looper letters, 276 selfloop transitions, 203 changer transitions 6/487 dead transitions.
[2023-11-01 16:34:59,947 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 487 transitions, 5040 flow
[2023-11-01 16:34:59,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-11-01 16:34:59,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-11-01 16:34:59,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1342 transitions.
[2023-11-01 16:34:59,951 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34060913705583756
[2023-11-01 16:34:59,951 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1342 transitions.
[2023-11-01 16:34:59,952 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1342 transitions.
[2023-11-01 16:34:59,952 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:34:59,952 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1342 transitions.
[2023-11-01 16:34:59,954 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 67.1) internal successors, (1342), 20 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:59,957 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:59,958 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:59,958 INFO  L175             Difference]: Start difference. First operand has 117 places, 286 transitions, 2600 flow. Second operand 20 states and 1342 transitions.
[2023-11-01 16:34:59,958 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 487 transitions, 5040 flow
[2023-11-01 16:34:59,980 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 487 transitions, 5016 flow, removed 6 selfloop flow, removed 4 redundant places.
[2023-11-01 16:34:59,987 INFO  L231             Difference]: Finished difference. Result has 137 places, 364 transitions, 4084 flow
[2023-11-01 16:34:59,988 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=2586, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4084, PETRI_PLACES=137, PETRI_TRANSITIONS=364}
[2023-11-01 16:34:59,989 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 78 predicate places.
[2023-11-01 16:34:59,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 364 transitions, 4084 flow
[2023-11-01 16:34:59,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.65384615384615) internal successors, (1473), 26 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:34:59,990 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:34:59,990 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]
[2023-11-01 16:34:59,997 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-01 16:35:00,190 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:35:00,191 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-01 16:35:00,192 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:35:00,192 INFO  L85        PathProgramCache]: Analyzing trace with hash -920454980, now seen corresponding path program 1 times
[2023-11-01 16:35:00,192 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:35:00,192 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596243754]
[2023-11-01 16:35:00,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:00,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:35:00,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:00,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:00,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:35:00,508 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596243754]
[2023-11-01 16:35:00,509 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596243754] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:35:00,509 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777658470]
[2023-11-01 16:35:00,509 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:00,509 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:35:00,509 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:35:00,510 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)
[2023-11-01 16:35:00,511 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
[2023-11-01 16:35:00,598 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:00,600 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-11-01 16:35:00,605 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:35:00,638 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 17 treesize of output 9
[2023-11-01 16:35:00,734 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:35:00,763 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:00,764 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
[2023-11-01 16:35:00,800 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:00,803 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:00,804 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
[2023-11-01 16:35:00,849 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:00,851 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:00,852 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:00,853 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
[2023-11-01 16:35:00,943 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:00,946 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:35:00,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:00,984 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:35:01,009 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~p~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false
[2023-11-01 16:35:01,070 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39)))) is different from false
[2023-11-01 16:35:01,422 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |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) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39))) (forall ((v_threadThread1of1ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~p~0.base_39 v_ArrVal_680) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~p~0.base_39)))))) is different from false
[2023-11-01 16:35:01,600 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:35:01,601 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 33 treesize of output 49
[2023-11-01 16:35:01,609 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:35:01,610 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 60 treesize of output 34
[2023-11-01 16:35:01,613 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 5 treesize of output 3
[2023-11-01 16:35:01,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:01,708 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777658470] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:35:01,708 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:35:01,709 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-11-01 16:35:01,709 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842276009]
[2023-11-01 16:35:01,709 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:35:01,711 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-11-01 16:35:01,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:35:01,711 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-11-01 16:35:01,712 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=520, Unknown=17, NotChecked=150, Total=812
[2023-11-01 16:35:01,824 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 197
[2023-11-01 16:35:01,825 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 364 transitions, 4084 flow. Second operand  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:01,825 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:35:01,825 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 197
[2023-11-01 16:35:01,826 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:35:02,608 INFO  L130       PetriNetUnfolder]: 506/1193 cut-off events.
[2023-11-01 16:35:02,608 INFO  L131       PetriNetUnfolder]: For 8524/8531 co-relation queries the response was YES.
[2023-11-01 16:35:02,612 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7861 conditions, 1193 events. 506/1193 cut-off events. For 8524/8531 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7068 event pairs, 48 based on Foata normal form. 29/1221 useless extension candidates. Maximal degree in co-relation 7689. Up to 1103 conditions per place. 
[2023-11-01 16:35:02,619 INFO  L137   encePairwiseOnDemand]: 188/197 looper letters, 365 selfloop transitions, 13 changer transitions 1/381 dead transitions.
[2023-11-01 16:35:02,619 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 381 transitions, 4949 flow
[2023-11-01 16:35:02,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-11-01 16:35:02,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-11-01 16:35:02,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 643 transitions.
[2023-11-01 16:35:02,622 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.32639593908629444
[2023-11-01 16:35:02,622 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 643 transitions.
[2023-11-01 16:35:02,622 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 643 transitions.
[2023-11-01 16:35:02,623 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:35:02,623 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 643 transitions.
[2023-11-01 16:35:02,624 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 64.3) internal successors, (643), 10 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:02,626 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:02,626 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:02,627 INFO  L175             Difference]: Start difference. First operand has 137 places, 364 transitions, 4084 flow. Second operand 10 states and 643 transitions.
[2023-11-01 16:35:02,627 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 381 transitions, 4949 flow
[2023-11-01 16:35:02,664 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 381 transitions, 4786 flow, removed 42 selfloop flow, removed 12 redundant places.
[2023-11-01 16:35:02,669 INFO  L231             Difference]: Finished difference. Result has 133 places, 349 transitions, 3800 flow
[2023-11-01 16:35:02,669 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3800, PETRI_PLACES=133, PETRI_TRANSITIONS=349}
[2023-11-01 16:35:02,670 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 74 predicate places.
[2023-11-01 16:35:02,670 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 349 transitions, 3800 flow
[2023-11-01 16:35:02,670 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:02,670 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:35:02,671 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:35:02,679 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2023-11-01 16:35:02,871 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:35:02,872 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-01 16:35:02,873 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:35:02,873 INFO  L85        PathProgramCache]: Analyzing trace with hash 819311960, now seen corresponding path program 2 times
[2023-11-01 16:35:02,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:35:02,873 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837082916]
[2023-11-01 16:35:02,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:02,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:35:02,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:03,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:03,327 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:35:03,327 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837082916]
[2023-11-01 16:35:03,327 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837082916] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:35:03,327 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249099749]
[2023-11-01 16:35:03,328 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-01 16:35:03,328 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:35:03,328 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:35:03,329 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)
[2023-11-01 16:35:03,331 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
[2023-11-01 16:35:03,465 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 16:35:03,465 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:35:03,467 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjunts are in the unsatisfiable core
[2023-11-01 16:35:03,475 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:35:03,513 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 26 treesize of output 14
[2023-11-01 16:35:03,520 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
[2023-11-01 16:35:03,658 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:35:03,699 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:03,699 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
[2023-11-01 16:35:03,739 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:03,740 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:03,741 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
[2023-11-01 16:35:03,792 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:03,793 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 32 treesize of output 30
[2023-11-01 16:35:03,815 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:03,816 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:03,817 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:03,819 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
[2023-11-01 16:35:03,860 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:03,860 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:35:03,887 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:03,888 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:35:03,907 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:03,908 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:35:03,988 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:03,989 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:35:04,018 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:04,018 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:35:04,044 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_813 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-11-01 16:35:04,084 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2023-11-01 16:35:04,135 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:35:04,153 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse0 c_threadThread1of1ForFork0_~p~0.base (store (select .cse0 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false
[2023-11-01 16:35:04,183 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse0 c_threadThread1of1ForFork0_~p~0.base (store (select .cse0 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_807 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_807))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_813) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:35:04,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked.
[2023-11-01 16:35:04,290 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [249099749] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:35:04,290 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:35:04,290 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 26
[2023-11-01 16:35:04,290 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767059284]
[2023-11-01 16:35:04,290 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:35:04,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-11-01 16:35:04,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:35:04,291 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-11-01 16:35:04,291 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=417, Unknown=5, NotChecked=230, Total=756
[2023-11-01 16:35:04,292 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 197
[2023-11-01 16:35:04,293 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 349 transitions, 3800 flow. Second operand  has 28 states, 28 states have (on average 51.964285714285715) internal successors, (1455), 28 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:04,293 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:35:04,293 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 197
[2023-11-01 16:35:04,293 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:35:06,168 INFO  L130       PetriNetUnfolder]: 499/1175 cut-off events.
[2023-11-01 16:35:06,169 INFO  L131       PetriNetUnfolder]: For 7545/7552 co-relation queries the response was YES.
[2023-11-01 16:35:06,172 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7604 conditions, 1175 events. 499/1175 cut-off events. For 7545/7552 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6971 event pairs, 21 based on Foata normal form. 22/1196 useless extension candidates. Maximal degree in co-relation 7438. Up to 399 conditions per place. 
[2023-11-01 16:35:06,178 INFO  L137   encePairwiseOnDemand]: 162/197 looper letters, 280 selfloop transitions, 219 changer transitions 6/507 dead transitions.
[2023-11-01 16:35:06,178 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 507 transitions, 6268 flow
[2023-11-01 16:35:06,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-01 16:35:06,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-01 16:35:06,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1166 transitions.
[2023-11-01 16:35:06,181 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3115148276783329
[2023-11-01 16:35:06,181 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1166 transitions.
[2023-11-01 16:35:06,181 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1166 transitions.
[2023-11-01 16:35:06,182 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:35:06,182 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1166 transitions.
[2023-11-01 16:35:06,184 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 61.36842105263158) internal successors, (1166), 19 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:06,187 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:06,188 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:06,188 INFO  L175             Difference]: Start difference. First operand has 133 places, 349 transitions, 3800 flow. Second operand 19 states and 1166 transitions.
[2023-11-01 16:35:06,188 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 507 transitions, 6268 flow
[2023-11-01 16:35:06,219 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 507 transitions, 6250 flow, removed 0 selfloop flow, removed 7 redundant places.
[2023-11-01 16:35:06,225 INFO  L231             Difference]: Finished difference. Result has 147 places, 364 transitions, 4621 flow
[2023-11-01 16:35:06,225 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3782, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4621, PETRI_PLACES=147, PETRI_TRANSITIONS=364}
[2023-11-01 16:35:06,226 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 88 predicate places.
[2023-11-01 16:35:06,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 364 transitions, 4621 flow
[2023-11-01 16:35:06,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 51.964285714285715) internal successors, (1455), 28 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:06,227 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:35:06,227 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-11-01 16:35:06,235 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2023-11-01 16:35:06,427 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2023-11-01 16:35:06,428 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-11-01 16:35:06,429 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:35:06,429 INFO  L85        PathProgramCache]: Analyzing trace with hash -1870719176, now seen corresponding path program 1 times
[2023-11-01 16:35:06,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:35:06,430 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298772323]
[2023-11-01 16:35:06,430 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:06,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:35:06,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 16:35:06,462 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-01 16:35:06,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-01 16:35:06,492 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-01 16:35:06,492 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-01 16:35:06,493 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2023-11-01 16:35:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-11-01 16:35:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-11-01 16:35:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-11-01 16:35:06,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-11-01 16:35:06,495 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2023-11-01 16:35:06,495 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-11-01 16:35:06,495 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-11-01 16:35:06,495 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-11-01 16:35:06,495 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-01 16:35:06,495 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:35:06,497 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-01 16:35:06,497 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-01 16:35:06,510 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-01 16:35:06,512 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-11-01 16:35:06,539 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-11-01 16:35:06,539 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-01 16:35:06,539 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 736 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-11-01 16:35:06,539 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2023-11-01 16:35:06,541 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2023-11-01 16:35:06,541 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-01 16:35:06,541 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2023-11-01 16:35:06,541 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2023-11-01 16:35:06,541 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2023-11-01 16:35:06,559 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2023-11-01 16:35:06,560 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-01 16:35:06,560 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 736 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2023-11-01 16:35:06,563 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2023-11-01 16:35:08,836 INFO  L134        LiptonReduction]: Checked pairs total: 23932
[2023-11-01 16:35:08,837 INFO  L136        LiptonReduction]: Total number of compositions: 78
[2023-11-01 16:35:08,838 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-01 16:35:08,839 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;@3c0bdcf0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-01 16:35:08,839 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2023-11-01 16:35:08,841 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2023-11-01 16:35:08,842 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-01 16:35:08,842 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:35:08,842 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:35:08,842 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:35:08,843 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:35:08,843 INFO  L85        PathProgramCache]: Analyzing trace with hash 1725264381, now seen corresponding path program 1 times
[2023-11-01 16:35:08,843 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:35:08,843 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669441017]
[2023-11-01 16:35:08,844 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:08,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:35:08,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:08,940 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:08,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:35:08,940 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669441017]
[2023-11-01 16:35:08,940 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669441017] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:35:08,940 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:35:08,941 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:35:08,941 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183632617]
[2023-11-01 16:35:08,941 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:35:08,941 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:35:08,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:35:08,942 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:35:08,942 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:35:09,131 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217
[2023-11-01 16:35:09,132 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 154 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:09,133 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:35:09,133 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217
[2023-11-01 16:35:09,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:35:09,745 INFO  L130       PetriNetUnfolder]: 2858/5896 cut-off events.
[2023-11-01 16:35:09,745 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2023-11-01 16:35:09,750 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10786 conditions, 5896 events. 2858/5896 cut-off events. For 191/349 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 40990 event pairs, 819 based on Foata normal form. 0/5496 useless extension candidates. Maximal degree in co-relation 5173. Up to 3444 conditions per place. 
[2023-11-01 16:35:09,764 INFO  L137   encePairwiseOnDemand]: 197/217 looper letters, 69 selfloop transitions, 42 changer transitions 0/142 dead transitions.
[2023-11-01 16:35:09,764 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 532 flow
[2023-11-01 16:35:09,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:35:09,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:35:09,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions.
[2023-11-01 16:35:09,766 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5890937019969278
[2023-11-01 16:35:09,766 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 767 transitions.
[2023-11-01 16:35:09,766 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions.
[2023-11-01 16:35:09,767 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:35:09,767 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions.
[2023-11-01 16:35:09,768 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:09,769 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:09,770 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:09,770 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 767 transitions.
[2023-11-01 16:35:09,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 532 flow
[2023-11-01 16:35:09,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 142 transitions, 532 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:35:09,772 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2023-11-01 16:35:09,772 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=81, PETRI_TRANSITIONS=110}
[2023-11-01 16:35:09,773 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2023-11-01 16:35:09,773 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2023-11-01 16:35:09,773 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:09,773 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:35:09,774 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:35:09,774 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-01 16:35:09,775 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:35:09,775 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:35:09,775 INFO  L85        PathProgramCache]: Analyzing trace with hash -329715416, now seen corresponding path program 1 times
[2023-11-01 16:35:09,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:35:09,775 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696209128]
[2023-11-01 16:35:09,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:09,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:35:09,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:09,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:09,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:35:09,809 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696209128]
[2023-11-01 16:35:09,809 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696209128] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:35:09,809 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:35:09,809 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-01 16:35:09,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512191946]
[2023-11-01 16:35:09,810 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:35:09,810 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-01 16:35:09,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:35:09,810 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-01 16:35:09,811 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-01 16:35:09,859 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 217
[2023-11-01 16:35:09,860 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 110 transitions, 446 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:09,860 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:35:09,861 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 217
[2023-11-01 16:35:09,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:35:10,206 INFO  L130       PetriNetUnfolder]: 1510/4077 cut-off events.
[2023-11-01 16:35:10,207 INFO  L131       PetriNetUnfolder]: For 1360/1548 co-relation queries the response was YES.
[2023-11-01 16:35:10,212 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8852 conditions, 4077 events. 1510/4077 cut-off events. For 1360/1548 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 31624 event pairs, 527 based on Foata normal form. 0/3748 useless extension candidates. Maximal degree in co-relation 3838. Up to 1446 conditions per place. 
[2023-11-01 16:35:10,220 INFO  L137   encePairwiseOnDemand]: 213/217 looper letters, 37 selfloop transitions, 3 changer transitions 2/121 dead transitions.
[2023-11-01 16:35:10,220 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 562 flow
[2023-11-01 16:35:10,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-01 16:35:10,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-01 16:35:10,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions.
[2023-11-01 16:35:10,222 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.618663594470046
[2023-11-01 16:35:10,223 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 537 transitions.
[2023-11-01 16:35:10,223 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions.
[2023-11-01 16:35:10,223 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:35:10,223 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions.
[2023-11-01 16:35:10,224 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:10,225 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:10,225 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:10,225 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 537 transitions.
[2023-11-01 16:35:10,225 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 562 flow
[2023-11-01 16:35:10,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 121 transitions, 562 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-01 16:35:10,230 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2023-11-01 16:35:10,230 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=86, PETRI_TRANSITIONS=112}
[2023-11-01 16:35:10,230 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2023-11-01 16:35:10,231 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2023-11-01 16:35:10,231 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:10,231 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:35:10,231 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:35:10,231 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-01 16:35:10,231 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:35:10,232 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:35:10,232 INFO  L85        PathProgramCache]: Analyzing trace with hash 580316733, now seen corresponding path program 1 times
[2023-11-01 16:35:10,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:35:10,232 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457783664]
[2023-11-01 16:35:10,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:10,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:35:10,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:10,325 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:10,325 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:35:10,325 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457783664]
[2023-11-01 16:35:10,325 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457783664] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:35:10,325 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:35:10,326 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:35:10,326 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396651399]
[2023-11-01 16:35:10,326 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:35:10,326 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:35:10,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:35:10,327 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:35:10,327 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:35:10,568 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 217
[2023-11-01 16:35:10,569 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 466 flow. Second operand  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:10,570 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:35:10,570 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 217
[2023-11-01 16:35:10,570 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:35:11,665 INFO  L130       PetriNetUnfolder]: 6215/11785 cut-off events.
[2023-11-01 16:35:11,665 INFO  L131       PetriNetUnfolder]: For 6036/6204 co-relation queries the response was YES.
[2023-11-01 16:35:11,683 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30089 conditions, 11785 events. 6215/11785 cut-off events. For 6036/6204 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 86479 event pairs, 1278 based on Foata normal form. 19/11441 useless extension candidates. Maximal degree in co-relation 29960. Up to 6839 conditions per place. 
[2023-11-01 16:35:11,716 INFO  L137   encePairwiseOnDemand]: 190/217 looper letters, 116 selfloop transitions, 104 changer transitions 1/253 dead transitions.
[2023-11-01 16:35:11,716 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 253 transitions, 1504 flow
[2023-11-01 16:35:11,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:35:11,717 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:35:11,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 749 transitions.
[2023-11-01 16:35:11,718 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5752688172043011
[2023-11-01 16:35:11,718 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 749 transitions.
[2023-11-01 16:35:11,718 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 749 transitions.
[2023-11-01 16:35:11,719 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:35:11,719 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 749 transitions.
[2023-11-01 16:35:11,720 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:11,721 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:11,722 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:11,722 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 749 transitions.
[2023-11-01 16:35:11,722 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 253 transitions, 1504 flow
[2023-11-01 16:35:11,730 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 253 transitions, 1501 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-01 16:35:11,733 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2023-11-01 16:35:11,733 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=95, PETRI_TRANSITIONS=215}
[2023-11-01 16:35:11,733 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2023-11-01 16:35:11,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2023-11-01 16:35:11,734 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:11,734 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:35:11,734 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]
[2023-11-01 16:35:11,735 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-01 16:35:11,735 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:35:11,735 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:35:11,735 INFO  L85        PathProgramCache]: Analyzing trace with hash 747515608, now seen corresponding path program 1 times
[2023-11-01 16:35:11,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:35:11,736 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346559106]
[2023-11-01 16:35:11,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:11,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:35:11,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:11,880 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:11,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:35:11,881 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346559106]
[2023-11-01 16:35:11,881 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346559106] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:35:11,881 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:35:11,881 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:35:11,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012560991]
[2023-11-01 16:35:11,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:35:11,882 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:35:11,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:35:11,882 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:35:11,883 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:35:11,983 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 217
[2023-11-01 16:35:11,985 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 215 transitions, 1492 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:11,985 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:35:11,985 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 217
[2023-11-01 16:35:11,985 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:35:14,153 INFO  L130       PetriNetUnfolder]: 10728/18665 cut-off events.
[2023-11-01 16:35:14,153 INFO  L131       PetriNetUnfolder]: For 23070/23295 co-relation queries the response was YES.
[2023-11-01 16:35:14,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63188 conditions, 18665 events. 10728/18665 cut-off events. For 23070/23295 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 132578 event pairs, 3389 based on Foata normal form. 4/17840 useless extension candidates. Maximal degree in co-relation 44831. Up to 15062 conditions per place. 
[2023-11-01 16:35:14,243 INFO  L137   encePairwiseOnDemand]: 183/217 looper letters, 241 selfloop transitions, 178 changer transitions 0/437 dead transitions.
[2023-11-01 16:35:14,243 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 437 transitions, 3398 flow
[2023-11-01 16:35:14,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:35:14,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:35:14,245 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions.
[2023-11-01 16:35:14,245 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6105990783410138
[2023-11-01 16:35:14,245 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 795 transitions.
[2023-11-01 16:35:14,246 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 795 transitions.
[2023-11-01 16:35:14,246 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:35:14,246 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 795 transitions.
[2023-11-01 16:35:14,247 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:14,248 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:14,248 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:14,249 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 795 transitions.
[2023-11-01 16:35:14,249 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 437 transitions, 3398 flow
[2023-11-01 16:35:14,273 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 437 transitions, 3388 flow, removed 5 selfloop flow, removed 1 redundant places.
[2023-11-01 16:35:14,277 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2023-11-01 16:35:14,277 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2975, PETRI_PLACES=102, PETRI_TRANSITIONS=377}
[2023-11-01 16:35:14,278 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2023-11-01 16:35:14,278 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2023-11-01 16:35:14,278 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:14,278 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:35:14,279 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:35:14,279 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-01 16:35:14,279 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:35:14,279 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:35:14,280 INFO  L85        PathProgramCache]: Analyzing trace with hash 102692192, now seen corresponding path program 1 times
[2023-11-01 16:35:14,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:35:14,280 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067102682]
[2023-11-01 16:35:14,280 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:14,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:35:14,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:14,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:14,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:35:14,556 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067102682]
[2023-11-01 16:35:14,556 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067102682] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:35:14,557 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163687262]
[2023-11-01 16:35:14,557 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:14,557 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:35:14,557 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:35:14,559 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)
[2023-11-01 16:35:14,561 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
[2023-11-01 16:35:14,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:14,656 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-11-01 16:35:14,660 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:35:14,686 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 17 treesize of output 9
[2023-11-01 16:35:14,737 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:35:14,757 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:35:14,789 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:35:14,790 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:35:14,828 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:35:14,829 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:35:14,880 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:14,881 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:35:14,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:14,890 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:35:14,908 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))) is different from false
[2023-11-01 16:35:14,927 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2023-11-01 16:35:14,949 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1100 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1100 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1100) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-11-01 16:35:15,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 16:35:15,049 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [163687262] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:35:15,049 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:35:15,049 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-11-01 16:35:15,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148977821]
[2023-11-01 16:35:15,049 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:35:15,050 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-01 16:35:15,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:35:15,050 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-01 16:35:15,051 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2023-11-01 16:35:15,081 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 65 out of 217
[2023-11-01 16:35:15,082 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:15,082 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:35:15,083 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 217
[2023-11-01 16:35:15,083 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:35:20,001 INFO  L130       PetriNetUnfolder]: 16562/27029 cut-off events.
[2023-11-01 16:35:20,002 INFO  L131       PetriNetUnfolder]: For 50811/50817 co-relation queries the response was YES.
[2023-11-01 16:35:20,067 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109425 conditions, 27029 events. 16562/27029 cut-off events. For 50811/50817 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 187796 event pairs, 4731 based on Foata normal form. 6/24531 useless extension candidates. Maximal degree in co-relation 73100. Up to 19181 conditions per place. 
[2023-11-01 16:35:20,155 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 551 selfloop transitions, 371 changer transitions 1/926 dead transitions.
[2023-11-01 16:35:20,156 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 926 transitions, 8498 flow
[2023-11-01 16:35:20,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-11-01 16:35:20,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2023-11-01 16:35:20,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1563 transitions.
[2023-11-01 16:35:20,159 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4001536098310292
[2023-11-01 16:35:20,159 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1563 transitions.
[2023-11-01 16:35:20,159 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1563 transitions.
[2023-11-01 16:35:20,159 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:35:20,159 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1563 transitions.
[2023-11-01 16:35:20,161 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 86.83333333333333) internal successors, (1563), 18 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:20,164 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 217.0) internal successors, (4123), 19 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:20,164 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 217.0) internal successors, (4123), 19 states have internal predecessors, (4123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:20,164 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 18 states and 1563 transitions.
[2023-11-01 16:35:20,165 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 926 transitions, 8498 flow
[2023-11-01 16:35:20,597 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 926 transitions, 8378 flow, removed 60 selfloop flow, removed 0 redundant places.
[2023-11-01 16:35:20,606 INFO  L231             Difference]: Finished difference. Result has 133 places, 653 transitions, 6935 flow
[2023-11-01 16:35:20,606 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6935, PETRI_PLACES=133, PETRI_TRANSITIONS=653}
[2023-11-01 16:35:20,607 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 62 predicate places.
[2023-11-01 16:35:20,607 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 653 transitions, 6935 flow
[2023-11-01 16:35:20,607 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:20,607 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:35:20,608 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:35:20,643 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2023-11-01 16:35:20,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-11-01 16:35:20,809 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:35:20,810 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:35:20,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -1170144666, now seen corresponding path program 1 times
[2023-11-01 16:35:20,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:35:20,810 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879979426]
[2023-11-01 16:35:20,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:20,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:35:20,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:21,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:21,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:35:21,068 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879979426]
[2023-11-01 16:35:21,068 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879979426] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:35:21,068 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380394760]
[2023-11-01 16:35:21,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:21,068 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:35:21,068 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:35:21,070 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)
[2023-11-01 16:35:21,071 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
[2023-11-01 16:35:21,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:21,194 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-11-01 16:35:21,196 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:35:21,220 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 17 treesize of output 9
[2023-11-01 16:35:21,331 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:35:21,351 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:21,351 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
[2023-11-01 16:35:21,379 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:21,380 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:21,381 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
[2023-11-01 16:35:21,422 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:21,423 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:21,424 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:21,425 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
[2023-11-01 16:35:21,455 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:21,456 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:35:21,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:21,479 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:35:21,709 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1213 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1213) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0))))) is different from false
[2023-11-01 16:35:21,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 16:35:21,830 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [380394760] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:35:21,830 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:35:21,830 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2023-11-01 16:35:21,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50739422]
[2023-11-01 16:35:21,831 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:35:21,831 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-11-01 16:35:21,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:35:21,832 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-11-01 16:35:21,832 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=520, Unknown=23, NotChecked=48, Total=702
[2023-11-01 16:35:21,961 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 217
[2023-11-01 16:35:21,963 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 653 transitions, 6935 flow. Second operand  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:21,963 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:35:21,963 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 217
[2023-11-01 16:35:21,963 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:35:28,965 INFO  L130       PetriNetUnfolder]: 19305/31847 cut-off events.
[2023-11-01 16:35:28,966 INFO  L131       PetriNetUnfolder]: For 113899/113899 co-relation queries the response was YES.
[2023-11-01 16:35:29,089 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 154854 conditions, 31847 events. 19305/31847 cut-off events. For 113899/113899 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 228008 event pairs, 2748 based on Foata normal form. 230/29258 useless extension candidates. Maximal degree in co-relation 134937. Up to 15974 conditions per place. 
[2023-11-01 16:35:29,206 INFO  L137   encePairwiseOnDemand]: 187/217 looper letters, 841 selfloop transitions, 489 changer transitions 0/1333 dead transitions.
[2023-11-01 16:35:29,206 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 1333 transitions, 15562 flow
[2023-11-01 16:35:29,207 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-11-01 16:35:29,207 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-11-01 16:35:29,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1382 transitions.
[2023-11-01 16:35:29,208 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3980414746543779
[2023-11-01 16:35:29,208 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1382 transitions.
[2023-11-01 16:35:29,208 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1382 transitions.
[2023-11-01 16:35:29,209 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:35:29,209 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1382 transitions.
[2023-11-01 16:35:29,210 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 86.375) internal successors, (1382), 16 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:29,213 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 217.0) internal successors, (3689), 17 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:29,214 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 217.0) internal successors, (3689), 17 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:29,214 INFO  L175             Difference]: Start difference. First operand has 133 places, 653 transitions, 6935 flow. Second operand 16 states and 1382 transitions.
[2023-11-01 16:35:29,214 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 1333 transitions, 15562 flow
[2023-11-01 16:35:30,794 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 1333 transitions, 15515 flow, removed 22 selfloop flow, removed 1 redundant places.
[2023-11-01 16:35:30,811 INFO  L231             Difference]: Finished difference. Result has 154 places, 931 transitions, 11989 flow
[2023-11-01 16:35:30,812 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=6889, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11989, PETRI_PLACES=154, PETRI_TRANSITIONS=931}
[2023-11-01 16:35:30,812 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 83 predicate places.
[2023-11-01 16:35:30,812 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 931 transitions, 11989 flow
[2023-11-01 16:35:30,813 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:30,813 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:35:30,813 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]
[2023-11-01 16:35:30,821 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-11-01 16:35:31,013 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,SelfDestructingSolverStorable16
[2023-11-01 16:35:31,015 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:35:31,015 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:35:31,016 INFO  L85        PathProgramCache]: Analyzing trace with hash 1669689062, now seen corresponding path program 1 times
[2023-11-01 16:35:31,016 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:35:31,016 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177301619]
[2023-11-01 16:35:31,016 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:31,017 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:35:31,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:31,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:31,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:35:31,313 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177301619]
[2023-11-01 16:35:31,313 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177301619] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:35:31,313 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716224935]
[2023-11-01 16:35:31,313 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:31,314 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:35:31,314 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:35:31,315 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:35:31,317 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-11-01 16:35:31,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:31,470 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-11-01 16:35:31,473 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:35:31,496 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 17 treesize of output 9
[2023-11-01 16:35:31,562 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:35:31,589 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:35:31,624 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:35:31,625 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:35:31,674 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:35:31,674 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:35:31,715 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:31,716 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:35:31,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:31,727 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:35:31,747 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-11-01 16:35:31,881 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1326 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1326 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1326) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-11-01 16:35:31,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:31,996 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [716224935] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:35:31,997 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:35:31,997 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2023-11-01 16:35:31,997 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613760596]
[2023-11-01 16:35:31,997 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:35:31,997 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-11-01 16:35:31,997 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:35:31,998 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-11-01 16:35:31,998 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=446, Unknown=12, NotChecked=90, Total=650
[2023-11-01 16:35:32,344 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 217
[2023-11-01 16:35:32,345 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 931 transitions, 11989 flow. Second operand  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:32,345 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:35:32,346 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 217
[2023-11-01 16:35:32,346 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:35:43,175 INFO  L130       PetriNetUnfolder]: 23371/38348 cut-off events.
[2023-11-01 16:35:43,175 INFO  L131       PetriNetUnfolder]: For 185516/185516 co-relation queries the response was YES.
[2023-11-01 16:35:43,344 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 210064 conditions, 38348 events. 23371/38348 cut-off events. For 185516/185516 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 282963 event pairs, 3764 based on Foata normal form. 0/35273 useless extension candidates. Maximal degree in co-relation 181911. Up to 26196 conditions per place. 
[2023-11-01 16:35:43,534 INFO  L137   encePairwiseOnDemand]: 153/217 looper letters, 975 selfloop transitions, 621 changer transitions 1/1600 dead transitions.
[2023-11-01 16:35:43,535 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1600 transitions, 20849 flow
[2023-11-01 16:35:43,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-11-01 16:35:43,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-11-01 16:35:43,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1627 transitions.
[2023-11-01 16:35:43,538 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3946155711860296
[2023-11-01 16:35:43,538 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1627 transitions.
[2023-11-01 16:35:43,539 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1627 transitions.
[2023-11-01 16:35:43,539 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:35:43,539 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1627 transitions.
[2023-11-01 16:35:43,542 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 85.63157894736842) internal successors, (1627), 19 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:43,545 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:43,545 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 217.0) internal successors, (4340), 20 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:43,545 INFO  L175             Difference]: Start difference. First operand has 154 places, 931 transitions, 11989 flow. Second operand 19 states and 1627 transitions.
[2023-11-01 16:35:43,545 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1600 transitions, 20849 flow
[2023-11-01 16:35:46,471 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1600 transitions, 20663 flow, removed 68 selfloop flow, removed 5 redundant places.
[2023-11-01 16:35:46,489 INFO  L231             Difference]: Finished difference. Result has 172 places, 1306 transitions, 18102 flow
[2023-11-01 16:35:46,489 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=11813, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=321, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=18102, PETRI_PLACES=172, PETRI_TRANSITIONS=1306}
[2023-11-01 16:35:46,490 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 101 predicate places.
[2023-11-01 16:35:46,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 1306 transitions, 18102 flow
[2023-11-01 16:35:46,490 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:46,490 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:35:46,491 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]
[2023-11-01 16:35:46,496 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2023-11-01 16:35:46,691 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-11-01 16:35:46,692 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:35:46,693 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:35:46,693 INFO  L85        PathProgramCache]: Analyzing trace with hash 517033069, now seen corresponding path program 1 times
[2023-11-01 16:35:46,693 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:35:46,693 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204607765]
[2023-11-01 16:35:46,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:46,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:35:46,713 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:46,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:46,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:35:46,967 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204607765]
[2023-11-01 16:35:46,967 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204607765] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:35:46,967 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045009630]
[2023-11-01 16:35:46,968 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:35:46,968 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:35:46,968 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:35:46,969 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:35:46,972 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-11-01 16:35:47,112 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:35:47,114 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2023-11-01 16:35:47,116 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:35:47,141 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 17 treesize of output 9
[2023-11-01 16:35:47,222 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:35:47,247 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:47,248 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
[2023-11-01 16:35:47,280 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:47,281 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:47,282 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
[2023-11-01 16:35:47,315 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:47,316 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:47,316 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:47,317 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
[2023-11-01 16:35:47,406 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:35:47,407 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:35:47,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:47,440 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:35:47,458 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2023-11-01 16:35:47,485 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2023-11-01 16:35:47,531 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_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))))) is different from false
[2023-11-01 16:35:47,565 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_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2))) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39)))))) is different from false
[2023-11-01 16:35:47,632 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 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|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (forall ((v_threadThread1of2ForFork0_~p~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~p~0.base_39) (forall ((v_ArrVal_1439 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~p~0.base_39 v_ArrVal_1439) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))))) is different from false
[2023-11-01 16:35:47,650 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:35:47,651 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
[2023-11-01 16:35:47,655 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:35:47,655 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
[2023-11-01 16:35:47,658 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
[2023-11-01 16:35:47,666 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:35:47,666 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 33 treesize of output 1
[2023-11-01 16:35:47,674 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:35:47,675 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 1
[2023-11-01 16:35:47,681 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:35:47,681 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 1
[2023-11-01 16:35:47,759 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:35:47,760 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045009630] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:35:47,760 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:35:47,760 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2023-11-01 16:35:47,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170234736]
[2023-11-01 16:35:47,760 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:35:47,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-11-01 16:35:47,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:35:47,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-11-01 16:35:47,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=455, Unknown=5, NotChecked=240, Total=812
[2023-11-01 16:35:47,885 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 217
[2023-11-01 16:35:47,887 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1306 transitions, 18102 flow. Second operand  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:35:47,887 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:35:47,887 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 217
[2023-11-01 16:35:47,887 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:36:00,729 INFO  L130       PetriNetUnfolder]: 27062/44967 cut-off events.
[2023-11-01 16:36:00,729 INFO  L131       PetriNetUnfolder]: For 320825/320835 co-relation queries the response was YES.
[2023-11-01 16:36:01,027 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 294720 conditions, 44967 events. 27062/44967 cut-off events. For 320825/320835 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 342153 event pairs, 3307 based on Foata normal form. 283/41530 useless extension candidates. Maximal degree in co-relation 256432. Up to 23187 conditions per place. 
[2023-11-01 16:36:01,255 INFO  L137   encePairwiseOnDemand]: 184/217 looper letters, 1188 selfloop transitions, 910 changer transitions 0/2101 dead transitions.
[2023-11-01 16:36:01,256 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 2101 transitions, 32784 flow
[2023-11-01 16:36:01,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-11-01 16:36:01,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2023-11-01 16:36:01,257 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1157 transitions.
[2023-11-01 16:36:01,258 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.380842659644503
[2023-11-01 16:36:01,258 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1157 transitions.
[2023-11-01 16:36:01,258 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1157 transitions.
[2023-11-01 16:36:01,258 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:36:01,258 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1157 transitions.
[2023-11-01 16:36:01,260 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 82.64285714285714) internal successors, (1157), 14 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:36:01,262 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 217.0) internal successors, (3255), 15 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:36:01,262 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 217.0) internal successors, (3255), 15 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:36:01,262 INFO  L175             Difference]: Start difference. First operand has 172 places, 1306 transitions, 18102 flow. Second operand 14 states and 1157 transitions.
[2023-11-01 16:36:01,262 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 2101 transitions, 32784 flow
[2023-11-01 16:36:08,730 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 2101 transitions, 32421 flow, removed 138 selfloop flow, removed 9 redundant places.
[2023-11-01 16:36:08,759 INFO  L231             Difference]: Finished difference. Result has 183 places, 1750 transitions, 28975 flow
[2023-11-01 16:36:08,760 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=17885, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=466, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=28975, PETRI_PLACES=183, PETRI_TRANSITIONS=1750}
[2023-11-01 16:36:08,760 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 112 predicate places.
[2023-11-01 16:36:08,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 1750 transitions, 28975 flow
[2023-11-01 16:36:08,761 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:36:08,761 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:36:08,761 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:36:08,768 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2023-11-01 16:36:08,961 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:36:08,962 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:36:08,963 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:36:08,963 INFO  L85        PathProgramCache]: Analyzing trace with hash -785127108, now seen corresponding path program 1 times
[2023-11-01 16:36:08,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:36:08,963 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251840249]
[2023-11-01 16:36:08,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:36:08,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:36:08,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:36:09,127 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-01 16:36:09,128 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:36:09,128 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251840249]
[2023-11-01 16:36:09,128 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251840249] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-01 16:36:09,128 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-01 16:36:09,128 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-01 16:36:09,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666761544]
[2023-11-01 16:36:09,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-01 16:36:09,128 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-01 16:36:09,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:36:09,129 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-01 16:36:09,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-01 16:36:09,514 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 217
[2023-11-01 16:36:09,515 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 1750 transitions, 28975 flow. Second operand  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:36:09,515 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:36:09,515 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 217
[2023-11-01 16:36:09,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:36:19,997 INFO  L130       PetriNetUnfolder]: 21880/39367 cut-off events.
[2023-11-01 16:36:19,997 INFO  L131       PetriNetUnfolder]: For 410800/417515 co-relation queries the response was YES.
[2023-11-01 16:36:20,228 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 266213 conditions, 39367 events. 21880/39367 cut-off events. For 410800/417515 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 331804 event pairs, 4147 based on Foata normal form. 1101/39049 useless extension candidates. Maximal degree in co-relation 240356. Up to 24514 conditions per place. 
[2023-11-01 16:36:20,406 INFO  L137   encePairwiseOnDemand]: 202/217 looper letters, 1438 selfloop transitions, 201 changer transitions 0/1965 dead transitions.
[2023-11-01 16:36:20,406 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1965 transitions, 35740 flow
[2023-11-01 16:36:20,407 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-01 16:36:20,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-01 16:36:20,408 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions.
[2023-11-01 16:36:20,408 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5898617511520737
[2023-11-01 16:36:20,408 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 768 transitions.
[2023-11-01 16:36:20,408 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions.
[2023-11-01 16:36:20,409 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:36:20,409 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions.
[2023-11-01 16:36:20,410 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:36:20,410 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:36:20,411 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:36:20,411 INFO  L175             Difference]: Start difference. First operand has 183 places, 1750 transitions, 28975 flow. Second operand 6 states and 768 transitions.
[2023-11-01 16:36:20,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1965 transitions, 35740 flow
[2023-11-01 16:36:24,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1965 transitions, 35658 flow, removed 0 selfloop flow, removed 6 redundant places.
[2023-11-01 16:36:24,763 INFO  L231             Difference]: Finished difference. Result has 187 places, 1938 transitions, 33051 flow
[2023-11-01 16:36:24,764 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=28893, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=33051, PETRI_PLACES=187, PETRI_TRANSITIONS=1938}
[2023-11-01 16:36:24,764 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 116 predicate places.
[2023-11-01 16:36:24,764 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 1938 transitions, 33051 flow
[2023-11-01 16:36:24,765 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:36:24,765 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:36:24,765 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:36:24,765 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-11-01 16:36:24,765 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:36:24,765 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:36:24,765 INFO  L85        PathProgramCache]: Analyzing trace with hash -672070267, now seen corresponding path program 2 times
[2023-11-01 16:36:24,766 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:36:24,766 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890274115]
[2023-11-01 16:36:24,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:36:24,766 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:36:24,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:36:25,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:36:25,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:36:25,141 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890274115]
[2023-11-01 16:36:25,141 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890274115] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:36:25,141 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703292187]
[2023-11-01 16:36:25,141 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-01 16:36:25,141 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:36:25,142 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:36:25,143 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:36:25,144 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-11-01 16:36:25,313 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 16:36:25,313 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:36:25,314 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 33 conjunts are in the unsatisfiable core
[2023-11-01 16:36:25,320 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:36:25,349 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 26 treesize of output 14
[2023-11-01 16:36:25,445 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:36:25,483 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-11-01 16:36:25,526 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:36:25,527 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:36:25,573 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:36:25,573 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:36:25,627 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:36:25,628 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:36:25,648 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:36:25,649 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:36:25,676 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:36:25,676 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:36:25,694 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:36:25,695 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:36:25,764 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:36:25,765 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:36:25,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:36:25,777 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:36:25,802 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-11-01 16:36:40,255 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-11-01 16:36:40,295 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:36:40,318 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1624) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:36:40,362 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:36:40,362 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 38 treesize of output 54
[2023-11-01 16:36:40,371 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:36:40,371 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 130 treesize of output 66
[2023-11-01 16:36:40,378 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 28 treesize of output 24
[2023-11-01 16:36:40,382 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 42 treesize of output 34
[2023-11-01 16:36:40,416 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:36:40,416 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1
[2023-11-01 16:36:40,423 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:36:40,423 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2023-11-01 16:36:40,432 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:36:40,432 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2023-11-01 16:36:40,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 4 times theorem prover too weak. 0 trivial. 4 not checked.
[2023-11-01 16:36:40,516 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703292187] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:36:40,516 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:36:40,516 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25
[2023-11-01 16:36:40,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193740725]
[2023-11-01 16:36:40,517 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:36:40,517 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-11-01 16:36:40,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:36:40,518 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-11-01 16:36:40,518 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=402, Unknown=19, NotChecked=180, Total=702
[2023-11-01 16:36:40,671 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 217
[2023-11-01 16:36:40,673 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1938 transitions, 33051 flow. Second operand  has 27 states, 27 states have (on average 65.18518518518519) internal successors, (1760), 27 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)
[2023-11-01 16:36:40,673 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:36:40,673 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 217
[2023-11-01 16:36:40,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:37:05,862 INFO  L130       PetriNetUnfolder]: 31291/52080 cut-off events.
[2023-11-01 16:37:05,862 INFO  L131       PetriNetUnfolder]: For 537104/537122 co-relation queries the response was YES.
[2023-11-01 16:37:06,209 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 383472 conditions, 52080 events. 31291/52080 cut-off events. For 537104/537122 co-relation queries the response was YES. Maximal size of possible extension queue 1425. Compared 405223 event pairs, 4267 based on Foata normal form. 12/48558 useless extension candidates. Maximal degree in co-relation 350443. Up to 26739 conditions per place. 
[2023-11-01 16:37:06,448 INFO  L137   encePairwiseOnDemand]: 153/217 looper letters, 1319 selfloop transitions, 1776 changer transitions 1/3100 dead transitions.
[2023-11-01 16:37:06,448 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 3100 transitions, 53789 flow
[2023-11-01 16:37:06,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2023-11-01 16:37:06,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2023-11-01 16:37:06,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1745 transitions.
[2023-11-01 16:37:06,451 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.402073732718894
[2023-11-01 16:37:06,451 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1745 transitions.
[2023-11-01 16:37:06,451 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1745 transitions.
[2023-11-01 16:37:06,452 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:37:06,452 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1745 transitions.
[2023-11-01 16:37:06,454 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 87.25) internal successors, (1745), 20 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:37:06,457 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 217.0) internal successors, (4557), 21 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:37:06,457 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 217.0) internal successors, (4557), 21 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:37:06,457 INFO  L175             Difference]: Start difference. First operand has 187 places, 1938 transitions, 33051 flow. Second operand 20 states and 1745 transitions.
[2023-11-01 16:37:06,457 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 3100 transitions, 53789 flow
[2023-11-01 16:37:17,242 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 3100 transitions, 53495 flow, removed 147 selfloop flow, removed 0 redundant places.
[2023-11-01 16:37:17,293 INFO  L231             Difference]: Finished difference. Result has 213 places, 2619 transitions, 49692 flow
[2023-11-01 16:37:17,294 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=32763, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=49692, PETRI_PLACES=213, PETRI_TRANSITIONS=2619}
[2023-11-01 16:37:17,295 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 142 predicate places.
[2023-11-01 16:37:17,295 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 2619 transitions, 49692 flow
[2023-11-01 16:37:17,295 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 65.18518518518519) internal successors, (1760), 27 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)
[2023-11-01 16:37:17,295 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:37:17,295 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:37:17,303 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2023-11-01 16:37:17,496 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:37:17,497 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:37:17,497 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:37:17,498 INFO  L85        PathProgramCache]: Analyzing trace with hash -72607429, now seen corresponding path program 1 times
[2023-11-01 16:37:17,498 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:37:17,498 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782570317]
[2023-11-01 16:37:17,498 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:37:17,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:37:17,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:37:17,986 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:37:17,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:37:17,986 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782570317]
[2023-11-01 16:37:17,986 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782570317] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:37:17,986 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878407602]
[2023-11-01 16:37:17,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:37:17,987 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:37:17,987 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:37:17,989 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:37:17,991 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-11-01 16:37:18,147 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:37:18,149 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core
[2023-11-01 16:37:18,154 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:37:18,164 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:37:18,168 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:37:18,172 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 38 treesize of output 32
[2023-11-01 16:37:18,650 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:37:18,651 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2023-11-01 16:37:18,755 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:37:18,755 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2023-11-01 16:37:18,897 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-11-01 16:37:18,897 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 63 treesize of output 40
[2023-11-01 16:37:18,926 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 11 treesize of output 7
[2023-11-01 16:37:18,937 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
[2023-11-01 16:37:18,957 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:37:18,958 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 30 treesize of output 32
[2023-11-01 16:37:18,978 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:37:18,978 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 39 treesize of output 44
[2023-11-01 16:37:19,001 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:37:19,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:37:19,015 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:37:19,273 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-11-01 16:37:19,294 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_1758 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_1758 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1758) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:37:19,315 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:37:19,315 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
[2023-11-01 16:37:19,322 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:37:19,322 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 84 treesize of output 32
[2023-11-01 16:37:19,333 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:37:19,333 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
[2023-11-01 16:37:19,340 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:37:19,341 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
[2023-11-01 16:37:19,347 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:37:19,347 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
[2023-11-01 16:37:21,737 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_70| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_#t~mem11#1.base_70| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_70| v_ArrVal_1748) .cse0 v_ArrVal_1749) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) .cse0))))) is different from false
[2023-11-01 16:37:21,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 16:37:21,739 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [878407602] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:37:21,739 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:37:21,739 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 27
[2023-11-01 16:37:21,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781864742]
[2023-11-01 16:37:21,739 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:37:21,740 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2023-11-01 16:37:21,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:37:21,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2023-11-01 16:37:21,740 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=528, Unknown=33, NotChecked=150, Total=812
[2023-11-01 16:37:21,924 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 217
[2023-11-01 16:37:21,925 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 2619 transitions, 49692 flow. Second operand  has 29 states, 29 states have (on average 61.51724137931034) internal successors, (1784), 29 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:37:21,926 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:37:21,926 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 217
[2023-11-01 16:37:21,926 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:37:58,696 INFO  L130       PetriNetUnfolder]: 42401/69855 cut-off events.
[2023-11-01 16:37:58,696 INFO  L131       PetriNetUnfolder]: For 983773/983773 co-relation queries the response was YES.
[2023-11-01 16:37:59,320 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 600770 conditions, 69855 events. 42401/69855 cut-off events. For 983773/983773 co-relation queries the response was YES. Maximal size of possible extension queue 1777. Compared 552941 event pairs, 5211 based on Foata normal form. 0/65500 useless extension candidates. Maximal degree in co-relation 549145. Up to 52766 conditions per place. 
[2023-11-01 16:37:59,701 INFO  L137   encePairwiseOnDemand]: 191/217 looper letters, 4102 selfloop transitions, 562 changer transitions 4/4669 dead transitions.
[2023-11-01 16:37:59,701 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 4669 transitions, 91268 flow
[2023-11-01 16:37:59,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-11-01 16:37:59,702 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-11-01 16:37:59,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1703 transitions.
[2023-11-01 16:37:59,704 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35672392124005026
[2023-11-01 16:37:59,704 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1703 transitions.
[2023-11-01 16:37:59,704 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1703 transitions.
[2023-11-01 16:37:59,705 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:37:59,705 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1703 transitions.
[2023-11-01 16:37:59,706 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 77.4090909090909) internal successors, (1703), 22 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:37:59,710 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:37:59,710 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 217.0) internal successors, (4991), 23 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:37:59,710 INFO  L175             Difference]: Start difference. First operand has 213 places, 2619 transitions, 49692 flow. Second operand 22 states and 1703 transitions.
[2023-11-01 16:37:59,710 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 4669 transitions, 91268 flow
[2023-11-01 16:38:39,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 4669 transitions, 89201 flow, removed 951 selfloop flow, removed 11 redundant places.
[2023-11-01 16:38:40,041 INFO  L231             Difference]: Finished difference. Result has 238 places, 3210 transitions, 62128 flow
[2023-11-01 16:38:40,043 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48472, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=62128, PETRI_PLACES=238, PETRI_TRANSITIONS=3210}
[2023-11-01 16:38:40,043 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 167 predicate places.
[2023-11-01 16:38:40,043 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 3210 transitions, 62128 flow
[2023-11-01 16:38:40,044 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 61.51724137931034) internal successors, (1784), 29 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:38:40,044 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:38:40,044 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:38:40,052 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2023-11-01 16:38:40,244 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2023-11-01 16:38:40,245 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:38:40,246 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:38:40,246 INFO  L85        PathProgramCache]: Analyzing trace with hash -824079329, now seen corresponding path program 2 times
[2023-11-01 16:38:40,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:38:40,247 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580257497]
[2023-11-01 16:38:40,247 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:38:40,247 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:38:40,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:38:40,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:38:40,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:38:40,705 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580257497]
[2023-11-01 16:38:40,705 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580257497] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:38:40,705 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885408132]
[2023-11-01 16:38:40,706 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-01 16:38:40,706 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:38:40,706 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:38:40,707 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:38:40,709 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2023-11-01 16:38:40,895 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 16:38:40,895 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:38:40,897 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 62 conjunts are in the unsatisfiable core
[2023-11-01 16:38:40,902 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:38:40,929 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 103 treesize of output 97
[2023-11-01 16:38:41,506 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-11-01 16:38:41,507 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59
[2023-11-01 16:38:41,515 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:38:41,519 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:38:41,537 INFO  L321             Elim1Store]: treesize reduction 15, result has 46.4 percent of original size
[2023-11-01 16:38:41,537 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 1 case distinctions, treesize of input 32 treesize of output 43
[2023-11-01 16:38:41,560 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 11 treesize of output 7
[2023-11-01 16:38:41,575 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 22 treesize of output 16
[2023-11-01 16:38:41,797 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
[2023-11-01 16:38:41,805 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
[2023-11-01 16:38:41,932 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 11 treesize of output 7
[2023-11-01 16:38:41,983 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:38:41,984 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 21 treesize of output 20
[2023-11-01 16:38:42,040 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:38:42,041 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:38:42,042 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 30 treesize of output 32
[2023-11-01 16:38:42,113 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:38:42,114 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:38:42,115 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:38:42,116 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 39 treesize of output 44
[2023-11-01 16:38:42,185 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:38:42,186 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:38:42,188 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:38:42,189 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 46 treesize of output 54
[2023-11-01 16:38:42,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:38:42,246 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:38:44,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:38:44,517 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885408132] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:38:44,517 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:38:44,518 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38
[2023-11-01 16:38:44,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876147957]
[2023-11-01 16:38:44,518 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:38:44,518 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2023-11-01 16:38:44,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:38:44,519 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2023-11-01 16:38:44,520 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1346, Unknown=13, NotChecked=0, Total=1560
[2023-11-01 16:38:50,966 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 217
[2023-11-01 16:38:50,968 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 3210 transitions, 62128 flow. Second operand  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:38:50,968 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:38:50,968 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 217
[2023-11-01 16:38:50,968 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:39:45,430 INFO  L130       PetriNetUnfolder]: 49229/80918 cut-off events.
[2023-11-01 16:39:45,430 INFO  L131       PetriNetUnfolder]: For 1456756/1456756 co-relation queries the response was YES.
[2023-11-01 16:39:46,348 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 739477 conditions, 80918 events. 49229/80918 cut-off events. For 1456756/1456756 co-relation queries the response was YES. Maximal size of possible extension queue 2161. Compared 659993 event pairs, 9643 based on Foata normal form. 0/76080 useless extension candidates. Maximal degree in co-relation 673964. Up to 68215 conditions per place. 
[2023-11-01 16:39:46,802 INFO  L137   encePairwiseOnDemand]: 189/217 looper letters, 3789 selfloop transitions, 531 changer transitions 8/4329 dead transitions.
[2023-11-01 16:39:46,803 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 4329 transitions, 91238 flow
[2023-11-01 16:39:46,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-11-01 16:39:46,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-11-01 16:39:46,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1454 transitions.
[2023-11-01 16:39:46,805 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2913243838910038
[2023-11-01 16:39:46,805 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1454 transitions.
[2023-11-01 16:39:46,806 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1454 transitions.
[2023-11-01 16:39:46,806 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:39:46,806 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1454 transitions.
[2023-11-01 16:39:46,808 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 63.21739130434783) internal successors, (1454), 23 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:39:46,811 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 217.0) internal successors, (5208), 24 states have internal predecessors, (5208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:39:46,811 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 217.0) internal successors, (5208), 24 states have internal predecessors, (5208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:39:46,811 INFO  L175             Difference]: Start difference. First operand has 238 places, 3210 transitions, 62128 flow. Second operand 23 states and 1454 transitions.
[2023-11-01 16:39:46,812 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 4329 transitions, 91238 flow
[2023-11-01 16:40:49,175 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 4329 transitions, 90392 flow, removed 421 selfloop flow, removed 2 redundant places.
[2023-11-01 16:40:49,245 INFO  L231             Difference]: Finished difference. Result has 270 places, 3790 transitions, 76723 flow
[2023-11-01 16:40:49,247 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=61302, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2895, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=76723, PETRI_PLACES=270, PETRI_TRANSITIONS=3790}
[2023-11-01 16:40:49,248 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 199 predicate places.
[2023-11-01 16:40:49,248 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 3790 transitions, 76723 flow
[2023-11-01 16:40:49,248 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 51.375) internal successors, (2055), 40 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:40:49,248 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:40:49,248 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:40:49,256 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2023-11-01 16:40:49,449 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2023-11-01 16:40:49,449 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:40:49,450 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:40:49,450 INFO  L85        PathProgramCache]: Analyzing trace with hash -1854593521, now seen corresponding path program 3 times
[2023-11-01 16:40:49,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:40:49,451 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42865719]
[2023-11-01 16:40:49,451 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:40:49,451 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:40:49,475 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:40:50,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:40:50,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:40:50,179 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42865719]
[2023-11-01 16:40:50,179 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42865719] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:40:50,179 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601665917]
[2023-11-01 16:40:50,180 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-11-01 16:40:50,180 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:40:50,180 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:40:50,181 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:40:50,184 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2023-11-01 16:40:50,408 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-11-01 16:40:50,409 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:40:50,410 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 82 conjunts are in the unsatisfiable core
[2023-11-01 16:40:50,414 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:40:50,449 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:50,452 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:50,456 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 22 treesize of output 16
[2023-11-01 16:40:51,280 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:40:51,280 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 70
[2023-11-01 16:40:51,290 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:51,292 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:51,294 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:51,295 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 32 treesize of output 35
[2023-11-01 16:40:51,534 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:40:51,534 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2023-11-01 16:40:51,541 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:51,543 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:51,544 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:51,545 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 28 treesize of output 31
[2023-11-01 16:40:51,679 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:40:51,894 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-11-01 16:40:51,894 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 63 treesize of output 35
[2023-11-01 16:40:51,906 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 0 case distinctions, treesize of input 22 treesize of output 10
[2023-11-01 16:40:51,981 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:51,982 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 21 treesize of output 20
[2023-11-01 16:40:52,051 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,053 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,054 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 30 treesize of output 32
[2023-11-01 16:40:52,132 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,133 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,135 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,136 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 39 treesize of output 44
[2023-11-01 16:40:52,228 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,229 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 41 treesize of output 37
[2023-11-01 16:40:52,273 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,274 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 41 treesize of output 37
[2023-11-01 16:40:52,308 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,309 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 41 treesize of output 37
[2023-11-01 16:40:52,349 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,351 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,352 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,354 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,355 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56
[2023-11-01 16:40:52,584 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,586 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:40:52,587 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 48 treesize of output 47
[2023-11-01 16:40:52,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:40:52,671 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:40:52,694 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-11-01 16:40:52,856 WARN  L837   $PredicateComparison]: unable to prove that (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|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2037 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2037 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2037 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-11-01 16:40:52,866 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:40:52,866 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 24
[2023-11-01 16:40:52,878 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:40:52,878 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 22
[2023-11-01 16:40:52,888 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:40:52,888 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 24
[2023-11-01 16:40:52,897 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:40:52,897 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 20 treesize of output 24
[2023-11-01 16:40:52,908 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_arrayElimArr_15 .cse0) 0)))) (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_17 .cse0) 0)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))) (not (= (select v_arrayElimArr_14 .cse0) 0)))) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 .cse0) 0)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:40:53,007 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|) (not (= (select v_arrayElimArr_17 .cse2) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse2) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 .cse2) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_arrayElimArr_15 .cse2) 0))))))) is different from false
[2023-11-01 16:40:53,054 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_17 .cse0) 0)) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_arrayElimArr_15 .cse0) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse0) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 .cse0) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))))))) is different from false
[2023-11-01 16:40:53,109 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse4 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse1)) (not (= (select v_arrayElimArr_16 .cse2) 0)))) (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse3)) (not (= (select v_arrayElimArr_17 .cse2) 0)))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (not (= (select v_arrayElimArr_15 .cse2) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse2) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse4))))))) is different from false
[2023-11-01 16:40:53,166 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse5 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse4 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 .cse0) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_16) .cse2 v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse3)))) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_15) .cse2 v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (not (= (select v_arrayElimArr_15 .cse0) 0)))) (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_17) .cse2 v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|) (not (= (select v_arrayElimArr_17 .cse0) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_2037 (Array Int Int))) (or (not (= (select v_arrayElimArr_14 .cse0) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_arrayElimArr_14) .cse2 v_ArrVal_2037) c_threadThread1of2ForFork0_~p~0.base) .cse5))))))) is different from false
[2023-11-01 16:40:53,287 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:40:53,288 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 40 treesize of output 56
[2023-11-01 16:40:53,297 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:40:53,297 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 138 treesize of output 76
[2023-11-01 16:40:53,302 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 52 treesize of output 48
[2023-11-01 16:40:53,315 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:40:53,315 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 39 treesize of output 43
[2023-11-01 16:40:53,390 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:40:53,391 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-01 16:40:53,399 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:40:53,399 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-01 16:40:53,409 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:40:53,409 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-01 16:40:53,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 16:40:53,654 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [601665917] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:40:53,654 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:40:53,654 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 38
[2023-11-01 16:40:53,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342557820]
[2023-11-01 16:40:53,655 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:40:53,655 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2023-11-01 16:40:53,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:40:53,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2023-11-01 16:40:53,656 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=920, Unknown=11, NotChecked=476, Total=1560
[2023-11-01 16:40:53,989 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2023-11-01 16:40:53,992 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 3790 transitions, 76723 flow. Second operand  has 40 states, 40 states have (on average 56.3) internal successors, (2252), 40 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:40:53,992 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:40:53,992 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2023-11-01 16:40:53,992 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:42:11,510 INFO  L130       PetriNetUnfolder]: 50173/82528 cut-off events.
[2023-11-01 16:42:11,510 INFO  L131       PetriNetUnfolder]: For 1647888/1647888 co-relation queries the response was YES.
[2023-11-01 16:42:12,633 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 775698 conditions, 82528 events. 50173/82528 cut-off events. For 1647888/1647888 co-relation queries the response was YES. Maximal size of possible extension queue 2229. Compared 672141 event pairs, 9453 based on Foata normal form. 0/77612 useless extension candidates. Maximal degree in co-relation 774182. Up to 73307 conditions per place. 
[2023-11-01 16:42:13,132 INFO  L137   encePairwiseOnDemand]: 166/217 looper letters, 5287 selfloop transitions, 787 changer transitions 100/6175 dead transitions.
[2023-11-01 16:42:13,133 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 6175 transitions, 127460 flow
[2023-11-01 16:42:13,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2023-11-01 16:42:13,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2023-11-01 16:42:13,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2835 transitions.
[2023-11-01 16:42:13,139 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.32661290322580644
[2023-11-01 16:42:13,139 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 2835 transitions.
[2023-11-01 16:42:13,139 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 2835 transitions.
[2023-11-01 16:42:13,140 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:42:13,140 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2835 transitions.
[2023-11-01 16:42:13,146 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 70.875) internal successors, (2835), 40 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:42:13,152 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 217.0) internal successors, (8897), 41 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:42:13,153 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 217.0) internal successors, (8897), 41 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:42:13,153 INFO  L175             Difference]: Start difference. First operand has 270 places, 3790 transitions, 76723 flow. Second operand 40 states and 2835 transitions.
[2023-11-01 16:42:13,153 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 6175 transitions, 127460 flow
[2023-11-01 16:43:28,798 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 6175 transitions, 125576 flow, removed 935 selfloop flow, removed 6 redundant places.
[2023-11-01 16:43:28,892 INFO  L231             Difference]: Finished difference. Result has 325 places, 4479 transitions, 91300 flow
[2023-11-01 16:43:28,895 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=75445, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=91300, PETRI_PLACES=325, PETRI_TRANSITIONS=4479}
[2023-11-01 16:43:28,895 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 254 predicate places.
[2023-11-01 16:43:28,895 INFO  L495      AbstractCegarLoop]: Abstraction has has 325 places, 4479 transitions, 91300 flow
[2023-11-01 16:43:28,896 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 56.3) internal successors, (2252), 40 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:43:28,896 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:43:28,896 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:43:28,903 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2023-11-01 16:43:29,097 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:43:29,098 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:43:29,098 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:43:29,098 INFO  L85        PathProgramCache]: Analyzing trace with hash 707852091, now seen corresponding path program 4 times
[2023-11-01 16:43:29,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:43:29,099 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423343852]
[2023-11-01 16:43:29,099 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:43:29,099 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:43:29,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:43:29,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:43:29,847 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:43:29,847 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423343852]
[2023-11-01 16:43:29,848 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423343852] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:43:29,848 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958071022]
[2023-11-01 16:43:29,848 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-11-01 16:43:29,848 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:43:29,849 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:43:29,850 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:43:29,852 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2023-11-01 16:43:30,140 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-11-01 16:43:30,140 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:43:30,142 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 55 conjunts are in the unsatisfiable core
[2023-11-01 16:43:30,148 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:43:30,171 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:30,175 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:30,179 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 38 treesize of output 32
[2023-11-01 16:43:30,275 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
[2023-11-01 16:43:30,873 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:43:30,873 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2023-11-01 16:43:31,019 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2023-11-01 16:43:31,020 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2023-11-01 16:43:31,118 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-11-01 16:43:31,210 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:31,211 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
[2023-11-01 16:43:31,319 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:31,321 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:31,324 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:43:31,324 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 1 case distinctions, treesize of input 30 treesize of output 32
[2023-11-01 16:43:31,438 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:31,440 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:31,442 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:31,446 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:43:31,447 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 3 case distinctions, treesize of input 39 treesize of output 44
[2023-11-01 16:43:31,757 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2023-11-01 16:43:31,757 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 63 treesize of output 40
[2023-11-01 16:43:31,855 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:31,856 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 41 treesize of output 37
[2023-11-01 16:43:31,887 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:31,889 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 41 treesize of output 37
[2023-11-01 16:43:31,919 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:31,920 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 41 treesize of output 37
[2023-11-01 16:43:31,957 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:43:31,958 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 41 treesize of output 37
[2023-11-01 16:43:32,079 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:43:32,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:43:32,146 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:43:32,175 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2175 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2175 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2175 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2175 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-11-01 16:43:32,225 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-11-01 16:43:32,295 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse0 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse0 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse0 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse0 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-11-01 16:43:32,372 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-11-01 16:43:32,400 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:43:32,432 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~p~0.offset 1)) (.cse3 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) .cse3))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) .cse4))) (forall ((v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2174) .cse1 v_ArrVal_2175) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2023-11-01 16:43:32,458 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:43:32,458 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 40 treesize of output 56
[2023-11-01 16:43:32,466 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:43:32,466 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 138 treesize of output 76
[2023-11-01 16:43:32,473 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 32 treesize of output 30
[2023-11-01 16:43:32,477 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 50 treesize of output 46
[2023-11-01 16:43:32,511 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:43:32,512 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-01 16:43:32,518 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:43:32,518 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-01 16:43:32,526 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:43:32,526 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-01 16:43:32,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-11-01 16:43:32,829 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [958071022] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:43:32,829 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:43:32,829 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35
[2023-11-01 16:43:32,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998889464]
[2023-11-01 16:43:32,830 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:43:32,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2023-11-01 16:43:32,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:43:32,831 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2023-11-01 16:43:32,832 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=805, Unknown=8, NotChecked=378, Total=1332
[2023-11-01 16:43:32,932 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2023-11-01 16:43:32,934 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 4479 transitions, 91300 flow. Second operand  has 37 states, 37 states have (on average 56.513513513513516) internal successors, (2091), 37 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)
[2023-11-01 16:43:32,934 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:43:32,934 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2023-11-01 16:43:32,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-01 16:45:08,667 INFO  L130       PetriNetUnfolder]: 50618/83226 cut-off events.
[2023-11-01 16:45:08,667 INFO  L131       PetriNetUnfolder]: For 2156544/2156544 co-relation queries the response was YES.
[2023-11-01 16:45:10,217 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 841313 conditions, 83226 events. 50618/83226 cut-off events. For 2156544/2156544 co-relation queries the response was YES. Maximal size of possible extension queue 2238. Compared 677878 event pairs, 8746 based on Foata normal form. 32/79877 useless extension candidates. Maximal degree in co-relation 839783. Up to 74229 conditions per place. 
[2023-11-01 16:45:10,737 INFO  L137   encePairwiseOnDemand]: 165/217 looper letters, 5248 selfloop transitions, 1087 changer transitions 72/6408 dead transitions.
[2023-11-01 16:45:10,737 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 6408 transitions, 135038 flow
[2023-11-01 16:45:10,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. 
[2023-11-01 16:45:10,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2023-11-01 16:45:10,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 4570 transitions.
[2023-11-01 16:45:10,743 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3143269825985281
[2023-11-01 16:45:10,743 INFO  L72            ComplementDD]: Start complementDD. Operand 67 states and 4570 transitions.
[2023-11-01 16:45:10,743 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 67 states and 4570 transitions.
[2023-11-01 16:45:10,744 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-01 16:45:10,744 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 4570 transitions.
[2023-11-01 16:45:10,748 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 68 states, 67 states have (on average 68.2089552238806) internal successors, (4570), 67 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:45:10,756 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 68 states, 68 states have (on average 217.0) internal successors, (14756), 68 states have internal predecessors, (14756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:45:10,757 INFO  L81            ComplementDD]: Finished complementDD. Result  has 68 states, 68 states have (on average 217.0) internal successors, (14756), 68 states have internal predecessors, (14756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:45:10,757 INFO  L175             Difference]: Start difference. First operand has 325 places, 4479 transitions, 91300 flow. Second operand 67 states and 4570 transitions.
[2023-11-01 16:45:10,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 6408 transitions, 135038 flow
[2023-11-01 16:47:04,140 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 6408 transitions, 133156 flow, removed 913 selfloop flow, removed 15 redundant places.
[2023-11-01 16:47:04,245 INFO  L231             Difference]: Finished difference. Result has 404 places, 5047 transitions, 105231 flow
[2023-11-01 16:47:04,248 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=89670, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=602, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=105231, PETRI_PLACES=404, PETRI_TRANSITIONS=5047}
[2023-11-01 16:47:04,248 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 333 predicate places.
[2023-11-01 16:47:04,248 INFO  L495      AbstractCegarLoop]: Abstraction has has 404 places, 5047 transitions, 105231 flow
[2023-11-01 16:47:04,249 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 56.513513513513516) internal successors, (2091), 37 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)
[2023-11-01 16:47:04,249 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-01 16:47:04,249 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-01 16:47:04,256 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2023-11-01 16:47:04,450 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:47:04,451 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2023-11-01 16:47:04,451 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-01 16:47:04,451 INFO  L85        PathProgramCache]: Analyzing trace with hash -1545097435, now seen corresponding path program 5 times
[2023-11-01 16:47:04,451 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-01 16:47:04,452 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396670063]
[2023-11-01 16:47:04,452 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-01 16:47:04,452 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-01 16:47:04,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-01 16:47:05,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:47:05,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-01 16:47:05,074 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396670063]
[2023-11-01 16:47:05,074 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396670063] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-01 16:47:05,074 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259210583]
[2023-11-01 16:47:05,075 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-11-01 16:47:05,075 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-01 16:47:05,075 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-01 16:47:05,076 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-01 16:47:05,079 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2023-11-01 16:47:05,260 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-01 16:47:05,261 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-01 16:47:05,263 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 61 conjunts are in the unsatisfiable core
[2023-11-01 16:47:05,267 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-01 16:47:05,279 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2023-11-01 16:47:05,280 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 55 treesize of output 43
[2023-11-01 16:47:05,336 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
[2023-11-01 16:47:05,678 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2023-11-01 16:47:05,679 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 56
[2023-11-01 16:47:05,690 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 22 treesize of output 16
[2023-11-01 16:47:05,774 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 23 treesize of output 23
[2023-11-01 16:47:05,837 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 11 treesize of output 7
[2023-11-01 16:47:05,895 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:47:05,896 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 21 treesize of output 20
[2023-11-01 16:47:05,974 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:47:05,975 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:47:05,976 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 30 treesize of output 32
[2023-11-01 16:47:06,036 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 24 treesize of output 12
[2023-11-01 16:47:06,105 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:47:06,107 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:47:06,108 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-01 16:47:06,109 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 39 treesize of output 44
[2023-11-01 16:47:06,175 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 41 treesize of output 37
[2023-11-01 16:47:06,212 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 41 treesize of output 37
[2023-11-01 16:47:06,240 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 41 treesize of output 37
[2023-11-01 16:47:06,268 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 41 treesize of output 37
[2023-11-01 16:47:06,364 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-11-01 16:47:06,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:47:06,411 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-01 16:47:06,438 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2314 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2314 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2314 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2023-11-01 16:47:06,482 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-11-01 16:47:06,549 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false
[2023-11-01 16:47:06,577 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2023-11-01 16:47:06,606 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) .cse2))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2313 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2313) .cse1 v_ArrVal_2314) c_threadThread1of2ForFork0_~p~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-11-01 16:47:06,821 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:47:06,821 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 42 treesize of output 58
[2023-11-01 16:47:06,829 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-01 16:47:06,829 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 228 treesize of output 154
[2023-11-01 16:47:06,836 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 126 treesize of output 110
[2023-11-01 16:47:06,843 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 59 treesize of output 51
[2023-11-01 16:47:06,881 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:47:06,881 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-01 16:47:06,891 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:47:06,891 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2023-11-01 16:47:06,901 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2023-11-01 16:47:06,901 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2023-11-01 16:47:07,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-01 16:47:07,158 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [259210583] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-01 16:47:07,159 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-01 16:47:07,159 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36
[2023-11-01 16:47:07,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784022518]
[2023-11-01 16:47:07,159 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-01 16:47:07,159 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2023-11-01 16:47:07,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-01 16:47:07,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2023-11-01 16:47:07,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=909, Unknown=22, NotChecked=330, Total=1406
[2023-11-01 16:47:07,344 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 217
[2023-11-01 16:47:07,346 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 5047 transitions, 105231 flow. Second operand  has 38 states, 38 states have (on average 56.36842105263158) internal successors, (2142), 38 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-01 16:47:07,346 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-01 16:47:07,346 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 217
[2023-11-01 16:47:07,346 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
