./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-struct.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-struct.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 73a9ab851ce1c73d80f83f7e6335d12ad87baacd38ef2209152d18ccc2128259
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 15:11:36,214 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 15:11:36,216 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 15:11:36,263 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 15:11:36,263 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 15:11:36,266 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 15:11:36,268 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 15:11:36,278 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 15:11:36,280 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 15:11:36,280 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 15:11:36,281 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 15:11:36,282 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 15:11:36,282 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 15:11:36,283 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 15:11:36,283 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 15:11:36,284 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 15:11:36,285 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 15:11:36,286 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 15:11:36,287 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 15:11:36,303 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 15:11:36,304 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 15:11:36,305 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 15:11:36,305 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 15:11:36,306 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 15:11:36,308 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 15:11:36,309 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 15:11:36,309 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 15:11:36,310 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 15:11:36,310 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 15:11:36,311 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 15:11:36,311 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 15:11:36,312 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 15:11:36,330 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 15:11:36,335 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 15:11:36,337 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 15:11:36,337 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 15:11:36,338 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 15:11:36,338 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 15:11:36,338 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 15:11:36,339 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 15:11:36,339 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 15:11:36,340 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 15:11:36,394 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 15:11:36,394 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 15:11:36,395 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 15:11:36,395 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 15:11:36,396 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 15:11:36,396 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 15:11:36,396 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 15:11:36,396 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 15:11:36,397 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 15:11:36,397 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 15:11:36,397 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 15:11:36,398 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 15:11:36,398 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 15:11:36,398 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 15:11:36,398 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 15:11:36,398 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 15:11:36,398 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 15:11:36,398 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 15:11:36,399 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 15:11:36,399 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 15:11:36,399 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 15:11:36,399 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 15:11:36,399 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 15:11:36,399 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 15:11:36,400 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 15:11:36,400 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 15:11:36,400 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:11:36,400 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 15:11:36,400 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 15:11:36,401 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 15:11:36,401 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 15:11:36,401 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 15:11:36,401 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 15:11:36,402 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 15:11:36,402 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 15:11:36,402 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 15:11:36,402 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 15:11:36,402 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 -> 73a9ab851ce1c73d80f83f7e6335d12ad87baacd38ef2209152d18ccc2128259
[2023-10-25 15:11:36,771 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 15:11:36,793 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 15:11:36,795 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 15:11:36,798 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 15:11:36,813 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 15:11:36,815 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i
[2023-10-25 15:11:38,469 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 15:11:38,872 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 15:11:38,888 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i
[2023-10-25 15:11:38,912 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/bc270c110/584868c918f74169b57cac4b3c37b569/FLAG048ee62bc
[2023-10-25 15:11:38,937 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/bc270c110/584868c918f74169b57cac4b3c37b569
[2023-10-25 15:11:38,941 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 15:11:38,942 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 15:11:38,943 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 15:11:38,943 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 15:11:38,945 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 15:11:38,945 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:11:38" (1/1) ...
[2023-10-25 15:11:38,948 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d9ae83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:38, skipping insertion in model container
[2023-10-25 15:11:38,948 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:11:38" (1/1) ...
[2023-10-25 15:11:38,966 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 15:11:39,031 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 15:11:39,273 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:11:39,560 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:11:39,578 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 15:11:39,588 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:11:39,675 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:11:39,756 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 15:11:39,765 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39 WrapperNode
[2023-10-25 15:11:39,765 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 15:11:39,767 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 15:11:39,767 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 15:11:39,767 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 15:11:39,778 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (1/1) ...
[2023-10-25 15:11:39,821 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (1/1) ...
[2023-10-25 15:11:39,879 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77
[2023-10-25 15:11:39,881 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 15:11:39,881 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 15:11:39,881 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 15:11:39,882 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 15:11:39,905 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (1/1) ...
[2023-10-25 15:11:39,905 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (1/1) ...
[2023-10-25 15:11:39,914 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (1/1) ...
[2023-10-25 15:11:39,915 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (1/1) ...
[2023-10-25 15:11:39,942 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (1/1) ...
[2023-10-25 15:11:39,953 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (1/1) ...
[2023-10-25 15:11:39,956 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (1/1) ...
[2023-10-25 15:11:39,967 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (1/1) ...
[2023-10-25 15:11:39,969 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 15:11:39,970 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 15:11:39,981 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 15:11:39,981 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 15:11:39,982 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (1/1) ...
[2023-10-25 15:11:39,990 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:11:39,998 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:11:40,033 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-25 15:11:40,081 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-25 15:11:40,087 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 15:11:40,091 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-25 15:11:40,091 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 15:11:40,091 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-25 15:11:40,091 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 15:11:40,092 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 15:11:40,092 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-25 15:11:40,092 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 15:11:40,092 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 15:11:40,092 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 15:11:40,092 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 15:11:40,093 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 15:11:40,322 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 15:11:40,324 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 15:11:40,698 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 15:11:40,704 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 15:11:40,717 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 15:11:40,720 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:11:40 BoogieIcfgContainer
[2023-10-25 15:11:40,720 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 15:11:40,723 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 15:11:40,723 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 15:11:40,727 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 15:11:40,741 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:11:38" (1/3) ...
[2023-10-25 15:11:40,742 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1768a735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:11:40, skipping insertion in model container
[2023-10-25 15:11:40,742 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:39" (2/3) ...
[2023-10-25 15:11:40,744 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1768a735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:11:40, skipping insertion in model container
[2023-10-25 15:11:40,744 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:11:40" (3/3) ...
[2023-10-25 15:11:40,745 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct.i
[2023-10-25 15:11:40,753 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 15:11:40,766 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 15:11:40,781 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2023-10-25 15:11:40,781 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 15:11:40,886 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-25 15:11:40,936 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2023-10-25 15:11:41,034 INFO  L130       PetriNetUnfolder]: 6/152 cut-off events.
[2023-10-25 15:11:41,045 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:11:41,050 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. 
[2023-10-25 15:11:41,065 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 214 flow
[2023-10-25 15:11:41,072 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 214 flow
[2023-10-25 15:11:41,075 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:11:41,095 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 103 transitions, 214 flow
[2023-10-25 15:11:41,107 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 103 transitions, 214 flow
[2023-10-25 15:11:41,110 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2023-10-25 15:11:41,189 INFO  L130       PetriNetUnfolder]: 6/152 cut-off events.
[2023-10-25 15:11:41,190 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:11:41,190 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 287 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. 
[2023-10-25 15:11:41,192 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1792
[2023-10-25 15:11:43,460 INFO  L134        LiptonReduction]: Checked pairs total: 7802
[2023-10-25 15:11:43,460 INFO  L136        LiptonReduction]: Total number of compositions: 64
[2023-10-25 15:11:43,479 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:11:43,503 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;@3e87cc99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:11:43,503 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-10-25 15:11:43,510 INFO  L130       PetriNetUnfolder]: 0/18 cut-off events.
[2023-10-25 15:11:43,511 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:11:43,511 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:43,512 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:43,512 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-25 15:11:43,517 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:43,517 INFO  L85        PathProgramCache]: Analyzing trace with hash -600513933, now seen corresponding path program 1 times
[2023-10-25 15:11:43,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:43,533 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752589197]
[2023-10-25 15:11:43,534 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:43,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:43,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:44,032 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:44,033 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:44,033 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752589197]
[2023-10-25 15:11:44,033 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752589197] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:44,034 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:44,034 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:11:44,035 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123242053]
[2023-10-25 15:11:44,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:44,041 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 15:11:44,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:44,081 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 15:11:44,086 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-25 15:11:44,170 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 167
[2023-10-25 15:11:44,174 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:44,189 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:44,189 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 167
[2023-10-25 15:11:44,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:44,328 INFO  L130       PetriNetUnfolder]: 24/218 cut-off events.
[2023-10-25 15:11:44,329 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-10-25 15:11:44,330 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 301 conditions, 218 events. 24/218 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 907 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 227. Up to 63 conditions per place. 
[2023-10-25 15:11:44,333 INFO  L137   encePairwiseOnDemand]: 163/167 looper letters, 19 selfloop transitions, 3 changer transitions 2/56 dead transitions.
[2023-10-25 15:11:44,333 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 168 flow
[2023-10-25 15:11:44,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:11:44,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:11:44,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions.
[2023-10-25 15:11:44,360 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5883233532934131
[2023-10-25 15:11:44,361 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 393 transitions.
[2023-10-25 15:11:44,361 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions.
[2023-10-25 15:11:44,364 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:44,366 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions.
[2023-10-25 15:11:44,385 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:44,392 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:44,392 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 167.0) internal successors, (835), 5 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:44,394 INFO  L175             Difference]: Start difference. First operand has 49 places, 47 transitions, 102 flow. Second operand 4 states and 393 transitions.
[2023-10-25 15:11:44,395 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 168 flow
[2023-10-25 15:11:44,397 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:11:44,405 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 118 flow
[2023-10-25 15:11:44,406 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2023-10-25 15:11:44,409 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places.
[2023-10-25 15:11:44,421 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 118 flow
[2023-10-25 15:11:44,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:44,421 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:44,422 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:44,422 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 15:11:44,423 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-25 15:11:44,423 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:44,424 INFO  L85        PathProgramCache]: Analyzing trace with hash -407873938, now seen corresponding path program 1 times
[2023-10-25 15:11:44,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:44,426 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290542546]
[2023-10-25 15:11:44,426 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:44,427 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:44,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:44,909 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:44,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:44,910 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290542546]
[2023-10-25 15:11:44,911 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290542546] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:44,911 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:44,914 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:11:44,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913869249]
[2023-10-25 15:11:44,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:44,915 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:11:44,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:44,916 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:11:44,916 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:11:45,131 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 167
[2023-10-25 15:11:45,132 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 118 flow. Second operand  has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:45,132 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:45,133 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 167
[2023-10-25 15:11:45,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:45,413 INFO  L130       PetriNetUnfolder]: 246/699 cut-off events.
[2023-10-25 15:11:45,413 INFO  L131       PetriNetUnfolder]: For 33/39 co-relation queries the response was YES.
[2023-10-25 15:11:45,416 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 699 events. 246/699 cut-off events. For 33/39 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3888 event pairs, 51 based on Foata normal form. 1/673 useless extension candidates. Maximal degree in co-relation 1254. Up to 348 conditions per place. 
[2023-10-25 15:11:45,419 INFO  L137   encePairwiseOnDemand]: 144/167 looper letters, 64 selfloop transitions, 29 changer transitions 1/104 dead transitions.
[2023-10-25 15:11:45,419 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 104 transitions, 428 flow
[2023-10-25 15:11:45,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:11:45,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:11:45,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 534 transitions.
[2023-10-25 15:11:45,421 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5329341317365269
[2023-10-25 15:11:45,421 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 534 transitions.
[2023-10-25 15:11:45,422 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 534 transitions.
[2023-10-25 15:11:45,422 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:45,422 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 534 transitions.
[2023-10-25 15:11:45,423 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:45,425 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:45,426 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:45,426 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 118 flow. Second operand 6 states and 534 transitions.
[2023-10-25 15:11:45,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 104 transitions, 428 flow
[2023-10-25 15:11:45,428 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 104 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:11:45,429 INFO  L231             Difference]: Finished difference. Result has 63 places, 76 transitions, 330 flow
[2023-10-25 15:11:45,429 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=63, PETRI_TRANSITIONS=76}
[2023-10-25 15:11:45,445 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places.
[2023-10-25 15:11:45,446 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 76 transitions, 330 flow
[2023-10-25 15:11:45,446 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:45,446 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:45,447 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:45,447 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 15:11:45,447 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-25 15:11:45,448 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:45,448 INFO  L85        PathProgramCache]: Analyzing trace with hash 525784661, now seen corresponding path program 1 times
[2023-10-25 15:11:45,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:45,449 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100369012]
[2023-10-25 15:11:45,449 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:45,449 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:45,487 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:45,976 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:45,976 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:45,976 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100369012]
[2023-10-25 15:11:45,976 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100369012] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:45,977 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:45,977 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:11:45,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542385750]
[2023-10-25 15:11:45,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:45,978 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:11:45,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:45,994 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:11:45,994 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:11:46,117 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 167
[2023-10-25 15:11:46,117 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 76 transitions, 330 flow. Second operand  has 6 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:46,117 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:46,118 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 167
[2023-10-25 15:11:46,118 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:46,528 INFO  L130       PetriNetUnfolder]: 373/970 cut-off events.
[2023-10-25 15:11:46,528 INFO  L131       PetriNetUnfolder]: For 400/406 co-relation queries the response was YES.
[2023-10-25 15:11:46,534 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2641 conditions, 970 events. 373/970 cut-off events. For 400/406 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5726 event pairs, 93 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 2482. Up to 670 conditions per place. 
[2023-10-25 15:11:46,537 INFO  L137   encePairwiseOnDemand]: 145/167 looper letters, 83 selfloop transitions, 72 changer transitions 14/183 dead transitions.
[2023-10-25 15:11:46,537 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 183 transitions, 1068 flow
[2023-10-25 15:11:46,538 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:11:46,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:11:46,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 575 transitions.
[2023-10-25 15:11:46,541 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5738522954091816
[2023-10-25 15:11:46,541 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 575 transitions.
[2023-10-25 15:11:46,541 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 575 transitions.
[2023-10-25 15:11:46,542 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:46,542 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 575 transitions.
[2023-10-25 15:11:46,543 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:46,558 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:46,559 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:46,559 INFO  L175             Difference]: Start difference. First operand has 63 places, 76 transitions, 330 flow. Second operand 6 states and 575 transitions.
[2023-10-25 15:11:46,560 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 183 transitions, 1068 flow
[2023-10-25 15:11:46,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 183 transitions, 1052 flow, removed 5 selfloop flow, removed 2 redundant places.
[2023-10-25 15:11:46,569 INFO  L231             Difference]: Finished difference. Result has 69 places, 145 transitions, 864 flow
[2023-10-25 15:11:46,569 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=864, PETRI_PLACES=69, PETRI_TRANSITIONS=145}
[2023-10-25 15:11:46,570 INFO  L288   CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places.
[2023-10-25 15:11:46,571 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 145 transitions, 864 flow
[2023-10-25 15:11:46,571 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:46,571 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:46,571 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:11:46,571 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 15:11:46,574 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-25 15:11:46,574 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:46,575 INFO  L85        PathProgramCache]: Analyzing trace with hash 1168448851, now seen corresponding path program 1 times
[2023-10-25 15:11:46,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:46,575 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946193857]
[2023-10-25 15:11:46,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:46,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:46,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:11:46,633 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:11:46,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:11:46,703 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:11:46,706 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:11:46,707 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-10-25 15:11:46,717 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-10-25 15:11:46,717 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-10-25 15:11:46,717 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-10-25 15:11:46,718 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-10-25 15:11:46,718 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-10-25 15:11:46,718 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-10-25 15:11:46,718 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 15:11:46,719 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-10-25 15:11:46,723 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:11:46,723 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 15:11:46,763 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-25 15:11:46,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 260 flow
[2023-10-25 15:11:46,814 INFO  L130       PetriNetUnfolder]: 11/269 cut-off events.
[2023-10-25 15:11:46,815 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:11:46,818 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283 conditions, 269 events. 11/269 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 603 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. 
[2023-10-25 15:11:46,818 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 121 transitions, 260 flow
[2023-10-25 15:11:46,819 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 121 transitions, 260 flow
[2023-10-25 15:11:46,820 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:11:46,820 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 121 transitions, 260 flow
[2023-10-25 15:11:46,820 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 121 transitions, 260 flow
[2023-10-25 15:11:46,820 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 260 flow
[2023-10-25 15:11:46,851 INFO  L130       PetriNetUnfolder]: 11/269 cut-off events.
[2023-10-25 15:11:46,861 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:11:46,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283 conditions, 269 events. 11/269 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 603 event pairs, 0 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. 
[2023-10-25 15:11:46,865 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4512
[2023-10-25 15:11:49,030 INFO  L134        LiptonReduction]: Checked pairs total: 20227
[2023-10-25 15:11:49,031 INFO  L136        LiptonReduction]: Total number of compositions: 72
[2023-10-25 15:11:49,032 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:11:49,036 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;@3e87cc99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:11:49,037 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-25 15:11:49,039 INFO  L130       PetriNetUnfolder]: 0/18 cut-off events.
[2023-10-25 15:11:49,039 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:11:49,039 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:49,040 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:49,040 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:49,040 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:49,040 INFO  L85        PathProgramCache]: Analyzing trace with hash 320509981, now seen corresponding path program 1 times
[2023-10-25 15:11:49,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:49,041 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815542854]
[2023-10-25 15:11:49,041 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:49,042 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:49,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:49,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:49,105 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:49,105 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815542854]
[2023-10-25 15:11:49,106 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815542854] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:49,106 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:49,106 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:11:49,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057750247]
[2023-10-25 15:11:49,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:49,109 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 15:11:49,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:49,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 15:11:49,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-25 15:11:49,179 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 193
[2023-10-25 15:11:49,179 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 136 flow. Second operand  has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:49,179 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:49,180 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 193
[2023-10-25 15:11:49,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:49,435 INFO  L130       PetriNetUnfolder]: 406/1207 cut-off events.
[2023-10-25 15:11:49,435 INFO  L131       PetriNetUnfolder]: For 80/120 co-relation queries the response was YES.
[2023-10-25 15:11:49,453 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 1207 events. 406/1207 cut-off events. For 80/120 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7625 event pairs, 290 based on Foata normal form. 0/1076 useless extension candidates. Maximal degree in co-relation 650. Up to 713 conditions per place. 
[2023-10-25 15:11:49,457 INFO  L137   encePairwiseOnDemand]: 189/193 looper letters, 28 selfloop transitions, 3 changer transitions 2/70 dead transitions.
[2023-10-25 15:11:49,458 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 224 flow
[2023-10-25 15:11:49,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:11:49,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:11:49,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions.
[2023-10-25 15:11:49,459 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6036269430051814
[2023-10-25 15:11:49,459 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 466 transitions.
[2023-10-25 15:11:49,459 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions.
[2023-10-25 15:11:49,460 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:49,460 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions.
[2023-10-25 15:11:49,461 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:49,462 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:49,463 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:49,463 INFO  L175             Difference]: Start difference. First operand has 62 places, 59 transitions, 136 flow. Second operand 4 states and 466 transitions.
[2023-10-25 15:11:49,463 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 224 flow
[2023-10-25 15:11:49,464 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:11:49,465 INFO  L231             Difference]: Finished difference. Result has 67 places, 61 transitions, 156 flow
[2023-10-25 15:11:49,465 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=67, PETRI_TRANSITIONS=61}
[2023-10-25 15:11:49,467 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places.
[2023-10-25 15:11:49,467 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 156 flow
[2023-10-25 15:11:49,467 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:49,467 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:49,468 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:49,468 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 15:11:49,468 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:49,469 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:49,469 INFO  L85        PathProgramCache]: Analyzing trace with hash 684924882, now seen corresponding path program 1 times
[2023-10-25 15:11:49,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:49,469 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48805934]
[2023-10-25 15:11:49,469 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:49,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:49,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:49,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:49,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:49,735 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48805934]
[2023-10-25 15:11:49,735 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48805934] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:49,736 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:49,736 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:11:49,736 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260783943]
[2023-10-25 15:11:49,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:49,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:11:49,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:49,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:11:49,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:11:49,954 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2023-10-25 15:11:49,955 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 156 flow. Second operand  has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:49,955 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:49,955 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2023-10-25 15:11:49,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:51,749 INFO  L130       PetriNetUnfolder]: 5476/10051 cut-off events.
[2023-10-25 15:11:51,765 INFO  L131       PetriNetUnfolder]: For 425/445 co-relation queries the response was YES.
[2023-10-25 15:11:51,776 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19612 conditions, 10051 events. 5476/10051 cut-off events. For 425/445 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 70071 event pairs, 1407 based on Foata normal form. 2/9766 useless extension candidates. Maximal degree in co-relation 19515. Up to 6033 conditions per place. 
[2023-10-25 15:11:51,861 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 92 selfloop transitions, 48 changer transitions 1/154 dead transitions.
[2023-10-25 15:11:51,861 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 154 transitions, 644 flow
[2023-10-25 15:11:51,861 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:11:51,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:11:51,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions.
[2023-10-25 15:11:51,863 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5621761658031088
[2023-10-25 15:11:51,863 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 651 transitions.
[2023-10-25 15:11:51,863 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions.
[2023-10-25 15:11:51,864 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:51,864 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions.
[2023-10-25 15:11:51,865 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:51,866 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:51,868 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:51,868 INFO  L175             Difference]: Start difference. First operand has 67 places, 61 transitions, 156 flow. Second operand 6 states and 651 transitions.
[2023-10-25 15:11:51,868 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 154 transitions, 644 flow
[2023-10-25 15:11:51,871 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 154 transitions, 641 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:11:51,874 INFO  L231             Difference]: Finished difference. Result has 76 places, 108 transitions, 490 flow
[2023-10-25 15:11:51,874 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=76, PETRI_TRANSITIONS=108}
[2023-10-25 15:11:51,879 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places.
[2023-10-25 15:11:51,879 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 108 transitions, 490 flow
[2023-10-25 15:11:51,879 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.33333333333333) internal successors, (518), 6 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:51,880 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:51,880 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:51,880 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 15:11:51,880 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:51,881 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:51,881 INFO  L85        PathProgramCache]: Analyzing trace with hash 853559299, now seen corresponding path program 1 times
[2023-10-25 15:11:51,881 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:51,881 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928794479]
[2023-10-25 15:11:51,881 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:51,882 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:51,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:52,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:52,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:52,238 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928794479]
[2023-10-25 15:11:52,238 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928794479] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:52,238 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:52,238 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:11:52,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127080803]
[2023-10-25 15:11:52,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:52,239 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:11:52,239 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:52,239 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:11:52,240 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:11:52,378 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2023-10-25 15:11:52,379 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 108 transitions, 490 flow. Second operand  has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:52,379 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:52,379 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2023-10-25 15:11:52,379 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:55,360 INFO  L130       PetriNetUnfolder]: 9320/16178 cut-off events.
[2023-10-25 15:11:55,367 INFO  L131       PetriNetUnfolder]: For 8208/8322 co-relation queries the response was YES.
[2023-10-25 15:11:55,403 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44381 conditions, 16178 events. 9320/16178 cut-off events. For 8208/8322 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 114584 event pairs, 2813 based on Foata normal form. 0/15540 useless extension candidates. Maximal degree in co-relation 26087. Up to 11753 conditions per place. 
[2023-10-25 15:11:55,520 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 150 selfloop transitions, 142 changer transitions 0/309 dead transitions.
[2023-10-25 15:11:55,520 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 309 transitions, 1906 flow
[2023-10-25 15:11:55,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:11:55,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:11:55,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions.
[2023-10-25 15:11:55,523 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6018998272884283
[2023-10-25 15:11:55,523 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 697 transitions.
[2023-10-25 15:11:55,523 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions.
[2023-10-25 15:11:55,523 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:55,537 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions.
[2023-10-25 15:11:55,538 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:55,540 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:55,540 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:55,540 INFO  L175             Difference]: Start difference. First operand has 76 places, 108 transitions, 490 flow. Second operand 6 states and 697 transitions.
[2023-10-25 15:11:55,540 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 309 transitions, 1906 flow
[2023-10-25 15:11:55,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 309 transitions, 1896 flow, removed 5 selfloop flow, removed 1 redundant places.
[2023-10-25 15:11:55,583 INFO  L231             Difference]: Finished difference. Result has 84 places, 245 transitions, 1786 flow
[2023-10-25 15:11:55,584 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1786, PETRI_PLACES=84, PETRI_TRANSITIONS=245}
[2023-10-25 15:11:55,585 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places.
[2023-10-25 15:11:55,585 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 245 transitions, 1786 flow
[2023-10-25 15:11:55,585 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.33333333333333) internal successors, (524), 6 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:55,586 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:55,586 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:55,586 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-25 15:11:55,587 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:55,587 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:55,587 INFO  L85        PathProgramCache]: Analyzing trace with hash 2054895432, now seen corresponding path program 1 times
[2023-10-25 15:11:55,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:55,590 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592899997]
[2023-10-25 15:11:55,590 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:55,590 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:55,632 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:56,342 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:56,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:56,343 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592899997]
[2023-10-25 15:11:56,343 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592899997] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:11:56,343 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770574331]
[2023-10-25 15:11:56,343 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:56,343 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:11:56,343 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:11:56,359 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-10-25 15:11:56,411 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-10-25 15:11:56,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:56,535 INFO  L263         TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 23 conjunts are in the unsatisfiable core
[2023-10-25 15:11:56,539 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:11:56,782 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 15:11:56,826 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-10-25 15:11:56,879 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:11:56,880 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-10-25 15:11:56,950 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:11:56,950 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-10-25 15:11:57,017 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:11:57,018 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:11:57,035 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:57,036 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:11:57,243 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_246 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_246 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_246) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:11:57,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:57,389 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770574331] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:11:57,389 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:11:57,389 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22
[2023-10-25 15:11:57,389 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215181216]
[2023-10-25 15:11:57,389 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:11:57,390 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2023-10-25 15:11:57,390 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:57,390 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2023-10-25 15:11:57,390 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=412, Unknown=6, NotChecked=42, Total=552
[2023-10-25 15:11:57,627 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 193
[2023-10-25 15:11:57,629 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 245 transitions, 1786 flow. Second operand  has 24 states, 24 states have (on average 59.208333333333336) internal successors, (1421), 24 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:57,629 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:57,629 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 193
[2023-10-25 15:11:57,629 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:12:04,261 INFO  L130       PetriNetUnfolder]: 15201/25123 cut-off events.
[2023-10-25 15:12:04,269 INFO  L131       PetriNetUnfolder]: For 32286/32302 co-relation queries the response was YES.
[2023-10-25 15:12:04,335 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 91549 conditions, 25123 events. 15201/25123 cut-off events. For 32286/32302 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 176049 event pairs, 2473 based on Foata normal form. 444/24147 useless extension candidates. Maximal degree in co-relation 76139. Up to 10732 conditions per place. 
[2023-10-25 15:12:04,521 INFO  L137   encePairwiseOnDemand]: 142/193 looper letters, 792 selfloop transitions, 383 changer transitions 21/1201 dead transitions.
[2023-10-25 15:12:04,522 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 1201 transitions, 9892 flow
[2023-10-25 15:12:04,523 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-10-25 15:12:04,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2023-10-25 15:12:04,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1626 transitions.
[2023-10-25 15:12:04,527 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4680483592400691
[2023-10-25 15:12:04,527 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1626 transitions.
[2023-10-25 15:12:04,528 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1626 transitions.
[2023-10-25 15:12:04,528 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:12:04,528 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1626 transitions.
[2023-10-25 15:12:04,531 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 90.33333333333333) internal successors, (1626), 18 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:04,542 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 193.0) internal successors, (3667), 19 states have internal predecessors, (3667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:04,543 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 193.0) internal successors, (3667), 19 states have internal predecessors, (3667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:04,543 INFO  L175             Difference]: Start difference. First operand has 84 places, 245 transitions, 1786 flow. Second operand 18 states and 1626 transitions.
[2023-10-25 15:12:04,543 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 1201 transitions, 9892 flow
[2023-10-25 15:12:05,454 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 1201 transitions, 9766 flow, removed 63 selfloop flow, removed 0 redundant places.
[2023-10-25 15:12:05,482 INFO  L231             Difference]: Finished difference. Result has 115 places, 617 transitions, 6070 flow
[2023-10-25 15:12:05,483 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=1732, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6070, PETRI_PLACES=115, PETRI_TRANSITIONS=617}
[2023-10-25 15:12:05,485 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 53 predicate places.
[2023-10-25 15:12:05,485 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 617 transitions, 6070 flow
[2023-10-25 15:12:05,486 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 59.208333333333336) internal successors, (1421), 24 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:05,486 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:12:05,486 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:12:05,494 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-10-25 15:12:05,691 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:12:05,691 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:12:05,692 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:12:05,692 INFO  L85        PathProgramCache]: Analyzing trace with hash -1888961290, now seen corresponding path program 1 times
[2023-10-25 15:12:05,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:12:05,692 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823050117]
[2023-10-25 15:12:05,692 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:12:05,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:12:05,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:12:06,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:06,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:12:06,194 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823050117]
[2023-10-25 15:12:06,194 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823050117] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:12:06,194 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392000229]
[2023-10-25 15:12:06,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:12:06,195 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:12:06,195 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:12:06,206 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-10-25 15:12:06,258 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-10-25 15:12:06,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:12:06,349 INFO  L263         TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 25 conjunts are in the unsatisfiable core
[2023-10-25 15:12:06,351 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:12:06,485 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-25 15:12:06,524 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:06,524 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-10-25 15:12:06,573 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:06,574 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:06,578 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-10-25 15:12:06,646 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:06,647 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:06,648 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:06,649 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-10-25 15:12:06,715 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:12:06,717 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:12:06,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:06,763 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:12:06,935 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2023-10-25 15:12:06,973 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2023-10-25 15:12:07,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-25 15:12:07,114 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [392000229] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:12:07,114 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:12:07,114 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24
[2023-10-25 15:12:07,114 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345508908]
[2023-10-25 15:12:07,115 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:12:07,115 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 15:12:07,115 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:12:07,115 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 15:12:07,115 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=445, Unknown=15, NotChecked=90, Total=650
[2023-10-25 15:12:07,329 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 193
[2023-10-25 15:12:07,330 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 617 transitions, 6070 flow. Second operand  has 26 states, 26 states have (on average 64.0) internal successors, (1664), 26 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:07,330 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:12:07,330 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 193
[2023-10-25 15:12:07,330 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:12:13,564 INFO  L130       PetriNetUnfolder]: 18975/31328 cut-off events.
[2023-10-25 15:12:13,564 INFO  L131       PetriNetUnfolder]: For 112088/112120 co-relation queries the response was YES.
[2023-10-25 15:12:14,210 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 158373 conditions, 31328 events. 18975/31328 cut-off events. For 112088/112120 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 226175 event pairs, 2318 based on Foata normal form. 488/29980 useless extension candidates. Maximal degree in co-relation 146765. Up to 12748 conditions per place. 
[2023-10-25 15:12:14,501 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 836 selfloop transitions, 460 changer transitions 6/1307 dead transitions.
[2023-10-25 15:12:14,502 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 1307 transitions, 14709 flow
[2023-10-25 15:12:14,502 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-25 15:12:14,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-25 15:12:14,504 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 998 transitions.
[2023-10-25 15:12:14,504 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4309153713298791
[2023-10-25 15:12:14,505 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 998 transitions.
[2023-10-25 15:12:14,505 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 998 transitions.
[2023-10-25 15:12:14,505 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:12:14,505 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 998 transitions.
[2023-10-25 15:12:14,507 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 83.16666666666667) internal successors, (998), 12 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:14,520 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 193.0) internal successors, (2509), 13 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:14,521 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 193.0) internal successors, (2509), 13 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:14,521 INFO  L175             Difference]: Start difference. First operand has 115 places, 617 transitions, 6070 flow. Second operand 12 states and 998 transitions.
[2023-10-25 15:12:14,521 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 1307 transitions, 14709 flow
[2023-10-25 15:12:19,650 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 1307 transitions, 14552 flow, removed 77 selfloop flow, removed 1 redundant places.
[2023-10-25 15:12:19,665 INFO  L231             Difference]: Finished difference. Result has 132 places, 896 transitions, 10798 flow
[2023-10-25 15:12:19,665 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=6008, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10798, PETRI_PLACES=132, PETRI_TRANSITIONS=896}
[2023-10-25 15:12:19,666 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 70 predicate places.
[2023-10-25 15:12:19,666 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 896 transitions, 10798 flow
[2023-10-25 15:12:19,667 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.0) internal successors, (1664), 26 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:19,667 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:12:19,667 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-10-25 15:12:19,673 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-10-25 15:12:19,871 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:12:19,872 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:12:19,873 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:12:19,873 INFO  L85        PathProgramCache]: Analyzing trace with hash -1965125181, now seen corresponding path program 1 times
[2023-10-25 15:12:19,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:12:19,873 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995103972]
[2023-10-25 15:12:19,876 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:12:19,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:12:19,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:12:20,197 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:12:20,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:12:20,198 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995103972]
[2023-10-25 15:12:20,198 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995103972] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:12:20,198 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:12:20,198 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:12:20,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014545231]
[2023-10-25 15:12:20,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:12:20,199 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:12:20,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:12:20,199 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:12:20,199 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:12:20,511 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 193
[2023-10-25 15:12:20,512 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 896 transitions, 10798 flow. Second operand  has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:20,512 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:12:20,512 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 193
[2023-10-25 15:12:20,512 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:12:26,182 INFO  L130       PetriNetUnfolder]: 16418/28625 cut-off events.
[2023-10-25 15:12:26,183 INFO  L131       PetriNetUnfolder]: For 155479/157778 co-relation queries the response was YES.
[2023-10-25 15:12:26,297 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156092 conditions, 28625 events. 16418/28625 cut-off events. For 155479/157778 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 222329 event pairs, 2783 based on Foata normal form. 233/27907 useless extension candidates. Maximal degree in co-relation 148341. Up to 18865 conditions per place. 
[2023-10-25 15:12:26,546 INFO  L137   encePairwiseOnDemand]: 178/193 looper letters, 669 selfloop transitions, 214 changer transitions 14/1152 dead transitions.
[2023-10-25 15:12:26,547 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 1152 transitions, 15581 flow
[2023-10-25 15:12:26,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:12:26,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:12:26,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 669 transitions.
[2023-10-25 15:12:26,552 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5777202072538861
[2023-10-25 15:12:26,552 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 669 transitions.
[2023-10-25 15:12:26,552 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 669 transitions.
[2023-10-25 15:12:26,552 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:12:26,558 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 669 transitions.
[2023-10-25 15:12:26,561 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:26,563 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:26,564 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:26,564 INFO  L175             Difference]: Start difference. First operand has 132 places, 896 transitions, 10798 flow. Second operand 6 states and 669 transitions.
[2023-10-25 15:12:26,564 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 1152 transitions, 15581 flow
[2023-10-25 15:12:30,922 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 1152 transitions, 15559 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-10-25 15:12:30,938 INFO  L231             Difference]: Finished difference. Result has 139 places, 1087 transitions, 14274 flow
[2023-10-25 15:12:30,939 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=10776, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=896, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14274, PETRI_PLACES=139, PETRI_TRANSITIONS=1087}
[2023-10-25 15:12:30,939 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 77 predicate places.
[2023-10-25 15:12:30,940 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 1087 transitions, 14274 flow
[2023-10-25 15:12:30,940 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:30,940 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:12:30,940 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:12:30,940 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-25 15:12:30,940 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:12:30,941 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:12:30,941 INFO  L85        PathProgramCache]: Analyzing trace with hash 1935419539, now seen corresponding path program 1 times
[2023-10-25 15:12:30,941 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:12:30,942 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329411795]
[2023-10-25 15:12:30,942 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:12:30,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:12:30,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:12:31,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-10-25 15:12:31,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:12:31,269 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329411795]
[2023-10-25 15:12:31,269 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329411795] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:12:31,270 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:12:31,270 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:12:31,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648219231]
[2023-10-25 15:12:31,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:12:31,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:12:31,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:12:31,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:12:31,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:12:31,425 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193
[2023-10-25 15:12:31,425 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 1087 transitions, 14274 flow. Second operand  has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:31,425 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:12:31,425 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193
[2023-10-25 15:12:31,425 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:12:40,612 INFO  L130       PetriNetUnfolder]: 21716/37020 cut-off events.
[2023-10-25 15:12:40,613 INFO  L131       PetriNetUnfolder]: For 214832/216490 co-relation queries the response was YES.
[2023-10-25 15:12:40,797 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 215547 conditions, 37020 events. 21716/37020 cut-off events. For 214832/216490 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 288881 event pairs, 2980 based on Foata normal form. 108/35388 useless extension candidates. Maximal degree in co-relation 205724. Up to 28521 conditions per place. 
[2023-10-25 15:12:40,932 INFO  L137   encePairwiseOnDemand]: 166/193 looper letters, 1054 selfloop transitions, 542 changer transitions 59/1699 dead transitions.
[2023-10-25 15:12:40,933 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 1699 transitions, 24290 flow
[2023-10-25 15:12:40,933 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:12:40,933 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:12:40,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 693 transitions.
[2023-10-25 15:12:40,936 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5984455958549223
[2023-10-25 15:12:40,936 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 693 transitions.
[2023-10-25 15:12:40,936 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 693 transitions.
[2023-10-25 15:12:40,937 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:12:40,937 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 693 transitions.
[2023-10-25 15:12:40,938 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:40,940 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:40,940 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:40,940 INFO  L175             Difference]: Start difference. First operand has 139 places, 1087 transitions, 14274 flow. Second operand 6 states and 693 transitions.
[2023-10-25 15:12:40,940 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 1699 transitions, 24290 flow
[2023-10-25 15:12:48,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 1699 transitions, 24074 flow, removed 108 selfloop flow, removed 0 redundant places.
[2023-10-25 15:12:48,935 INFO  L231             Difference]: Finished difference. Result has 149 places, 1540 transitions, 22206 flow
[2023-10-25 15:12:48,936 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=14166, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1087, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=22206, PETRI_PLACES=149, PETRI_TRANSITIONS=1540}
[2023-10-25 15:12:48,937 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 87 predicate places.
[2023-10-25 15:12:48,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 1540 transitions, 22206 flow
[2023-10-25 15:12:48,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:48,937 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:12:48,938 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]
[2023-10-25 15:12:48,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 15:12:48,938 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:12:48,939 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:12:48,940 INFO  L85        PathProgramCache]: Analyzing trace with hash -1530475742, now seen corresponding path program 1 times
[2023-10-25 15:12:48,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:12:48,940 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027315651]
[2023-10-25 15:12:48,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:12:48,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:12:48,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:12:49,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:49,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:12:49,067 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027315651]
[2023-10-25 15:12:49,067 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027315651] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:12:49,067 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969659888]
[2023-10-25 15:12:49,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:12:49,067 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:12:49,067 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:12:49,069 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-10-25 15:12:49,112 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-10-25 15:12:49,220 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:12:49,221 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:12:49,223 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:12:49,264 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:49,265 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:12:49,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:49,308 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [969659888] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:12:49,308 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:12:49,308 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2023-10-25 15:12:49,309 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321477341]
[2023-10-25 15:12:49,309 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:12:49,310 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-10-25 15:12:49,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:12:49,310 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-10-25 15:12:49,310 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2023-10-25 15:12:49,407 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 193
[2023-10-25 15:12:49,408 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 1540 transitions, 22206 flow. Second operand  has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:49,408 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:12:49,408 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 193
[2023-10-25 15:12:49,408 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:12:55,384 INFO  L130       PetriNetUnfolder]: 14368/25966 cut-off events.
[2023-10-25 15:12:55,385 INFO  L131       PetriNetUnfolder]: For 188753/190826 co-relation queries the response was YES.
[2023-10-25 15:12:55,474 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156699 conditions, 25966 events. 14368/25966 cut-off events. For 188753/190826 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 206381 event pairs, 1525 based on Foata normal form. 242/25853 useless extension candidates. Maximal degree in co-relation 151433. Up to 9439 conditions per place. 
[2023-10-25 15:12:55,567 INFO  L137   encePairwiseOnDemand]: 186/193 looper letters, 295 selfloop transitions, 8 changer transitions 39/1452 dead transitions.
[2023-10-25 15:12:55,567 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 1452 transitions, 21652 flow
[2023-10-25 15:12:55,567 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 15:12:55,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 15:12:55,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions.
[2023-10-25 15:12:55,569 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5758697261287935
[2023-10-25 15:12:55,570 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 778 transitions.
[2023-10-25 15:12:55,570 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 778 transitions.
[2023-10-25 15:12:55,570 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:12:55,570 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 778 transitions.
[2023-10-25 15:12:55,573 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:55,575 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:55,589 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:55,590 INFO  L175             Difference]: Start difference. First operand has 149 places, 1540 transitions, 22206 flow. Second operand 7 states and 778 transitions.
[2023-10-25 15:12:55,590 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 1452 transitions, 21652 flow
[2023-10-25 15:13:00,712 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 1452 transitions, 21220 flow, removed 210 selfloop flow, removed 1 redundant places.
[2023-10-25 15:13:00,746 INFO  L231             Difference]: Finished difference. Result has 156 places, 1286 transitions, 18278 flow
[2023-10-25 15:13:00,759 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=18679, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=18278, PETRI_PLACES=156, PETRI_TRANSITIONS=1286}
[2023-10-25 15:13:00,759 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 94 predicate places.
[2023-10-25 15:13:00,759 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 1286 transitions, 18278 flow
[2023-10-25 15:13:00,760 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:00,760 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:13:00,760 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]
[2023-10-25 15:13:00,766 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-25 15:13:00,964 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-10-25 15:13:00,965 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:13:00,966 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:13:00,966 INFO  L85        PathProgramCache]: Analyzing trace with hash 860108621, now seen corresponding path program 1 times
[2023-10-25 15:13:00,967 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:13:00,967 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560308925]
[2023-10-25 15:13:00,967 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:13:00,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:13:01,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:13:01,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:13:01,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:13:01,803 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560308925]
[2023-10-25 15:13:01,803 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560308925] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:13:01,803 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117392150]
[2023-10-25 15:13:01,803 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:13:01,803 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:13:01,804 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:13:01,804 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-10-25 15:13:01,837 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-10-25 15:13:01,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:13:01,951 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 45 conjunts are in the unsatisfiable core
[2023-10-25 15:13:01,954 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:13:01,966 INFO  L321             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2023-10-25 15:13:01,966 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26
[2023-10-25 15:13:02,012 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2023-10-25 15:13:02,013 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2023-10-25 15:13:02,112 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 15:13:02,112 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-25 15:13:02,159 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-10-25 15:13:02,207 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-10-25 15:13:02,252 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-10-25 15:13:02,316 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:13:02,316 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2023-10-25 15:13:02,410 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:13:02,410 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2023-10-25 15:13:02,544 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-10-25 15:13:02,616 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-10-25 15:13:02,636 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-10-25 15:13:02,676 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-10-25 15:13:02,711 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-10-25 15:13:02,755 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:13:02,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:13:02,763 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:13:02,779 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_619 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_619 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-25 15:13:03,069 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_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse0 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-10-25 15:13:03,131 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~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_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:13:03,171 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~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_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_618) .cse1 v_ArrVal_619) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2023-10-25 15:13:03,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 15:13:03,441 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117392150] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:13:03,441 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:13:03,441 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30
[2023-10-25 15:13:03,441 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722552426]
[2023-10-25 15:13:03,441 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:13:03,441 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-10-25 15:13:03,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:13:03,442 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-10-25 15:13:03,442 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=625, Unknown=28, NotChecked=220, Total=992
[2023-10-25 15:13:03,458 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 193
[2023-10-25 15:13:03,459 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 1286 transitions, 18278 flow. Second operand  has 32 states, 32 states have (on average 54.21875) internal successors, (1735), 32 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:03,460 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:13:03,460 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 193
[2023-10-25 15:13:03,460 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:13:18,166 INFO  L130       PetriNetUnfolder]: 20802/34260 cut-off events.
[2023-10-25 15:13:18,166 INFO  L131       PetriNetUnfolder]: For 250421/250421 co-relation queries the response was YES.
[2023-10-25 15:13:18,300 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 222637 conditions, 34260 events. 20802/34260 cut-off events. For 250421/250421 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 247271 event pairs, 2244 based on Foata normal form. 10/34270 useless extension candidates. Maximal degree in co-relation 211217. Up to 29525 conditions per place. 
[2023-10-25 15:13:18,470 INFO  L137   encePairwiseOnDemand]: 146/193 looper letters, 1497 selfloop transitions, 380 changer transitions 37/1916 dead transitions.
[2023-10-25 15:13:18,471 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1916 transitions, 29258 flow
[2023-10-25 15:13:18,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2023-10-25 15:13:18,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2023-10-25 15:13:18,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1484 transitions.
[2023-10-25 15:13:18,482 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3495054168629298
[2023-10-25 15:13:18,482 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1484 transitions.
[2023-10-25 15:13:18,482 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1484 transitions.
[2023-10-25 15:13:18,492 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:13:18,505 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1484 transitions.
[2023-10-25 15:13:18,508 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 67.45454545454545) internal successors, (1484), 22 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:18,512 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 193.0) internal successors, (4439), 23 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:18,512 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 193.0) internal successors, (4439), 23 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:18,513 INFO  L175             Difference]: Start difference. First operand has 156 places, 1286 transitions, 18278 flow. Second operand 22 states and 1484 transitions.
[2023-10-25 15:13:18,513 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 1916 transitions, 29258 flow
[2023-10-25 15:13:25,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1916 transitions, 29237 flow, removed 5 selfloop flow, removed 4 redundant places.
[2023-10-25 15:13:25,216 INFO  L231             Difference]: Finished difference. Result has 184 places, 1574 transitions, 23564 flow
[2023-10-25 15:13:25,217 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=18268, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1012, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=23564, PETRI_PLACES=184, PETRI_TRANSITIONS=1574}
[2023-10-25 15:13:25,217 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 122 predicate places.
[2023-10-25 15:13:25,217 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 1574 transitions, 23564 flow
[2023-10-25 15:13:25,218 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 54.21875) internal successors, (1735), 32 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:25,218 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:13:25,218 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]
[2023-10-25 15:13:25,224 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-25 15:13:25,422 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:13:25,423 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:13:25,423 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:13:25,424 INFO  L85        PathProgramCache]: Analyzing trace with hash 103820759, now seen corresponding path program 2 times
[2023-10-25 15:13:25,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:13:25,424 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745074639]
[2023-10-25 15:13:25,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:13:25,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:13:25,479 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:13:26,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:13:26,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:13:26,388 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745074639]
[2023-10-25 15:13:26,388 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745074639] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:13:26,388 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748017373]
[2023-10-25 15:13:26,388 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 15:13:26,388 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:13:26,388 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:13:26,389 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-10-25 15:13:26,427 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-10-25 15:13:26,574 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 15:13:26,574 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:13:26,576 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 42 conjunts are in the unsatisfiable core
[2023-10-25 15:13:26,579 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:13:26,584 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:13:26,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 15
[2023-10-25 15:13:26,650 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2023-10-25 15:13:26,650 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 15 treesize of output 15
[2023-10-25 15:13:26,806 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 15:13:26,806 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-25 15:13:26,867 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:13:26,868 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-25 15:13:26,922 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-10-25 15:13:26,992 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2023-10-25 15:13:27,059 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:13:27,060 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-10-25 15:13:27,204 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-10-25 15:13:27,285 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:13:27,286 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-10-25 15:13:27,381 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:13:27,382 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-10-25 15:13:27,427 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:13:27,428 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-10-25 15:13:27,449 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:13:27,449 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-10-25 15:13:27,488 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:13:27,489 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-10-25 15:13:27,547 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:13:27,558 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:13:27,558 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:13:27,788 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2023-10-25 15:13:27,853 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2023-10-25 15:13:27,886 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~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_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:13:27,984 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~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_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_725) .cse1 v_ArrVal_726) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:13:28,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 15:13:28,301 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748017373] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:13:28,301 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:13:28,301 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 31
[2023-10-25 15:13:28,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432399050]
[2023-10-25 15:13:28,301 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:13:28,301 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2023-10-25 15:13:28,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:13:28,302 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2023-10-25 15:13:28,302 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=694, Unknown=18, NotChecked=228, Total=1056
[2023-10-25 15:13:28,735 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 193
[2023-10-25 15:13:28,736 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 1574 transitions, 23564 flow. Second operand  has 33 states, 33 states have (on average 54.15151515151515) internal successors, (1787), 33 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:28,736 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:13:28,736 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 193
[2023-10-25 15:13:28,736 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:13:47,595 INFO  L130       PetriNetUnfolder]: 21856/35970 cut-off events.
[2023-10-25 15:13:47,595 INFO  L131       PetriNetUnfolder]: For 317142/317142 co-relation queries the response was YES.
[2023-10-25 15:13:47,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 254830 conditions, 35970 events. 21856/35970 cut-off events. For 317142/317142 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 260666 event pairs, 2283 based on Foata normal form. 48/36018 useless extension candidates. Maximal degree in co-relation 254538. Up to 29357 conditions per place. 
[2023-10-25 15:13:48,000 INFO  L137   encePairwiseOnDemand]: 152/193 looper letters, 1640 selfloop transitions, 633 changer transitions 10/2285 dead transitions.
[2023-10-25 15:13:48,001 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 2285 transitions, 37541 flow
[2023-10-25 15:13:48,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2023-10-25 15:13:48,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2023-10-25 15:13:48,018 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1802 transitions.
[2023-10-25 15:13:48,019 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3458069468432163
[2023-10-25 15:13:48,027 INFO  L72            ComplementDD]: Start complementDD. Operand 27 states and 1802 transitions.
[2023-10-25 15:13:48,027 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 27 states and 1802 transitions.
[2023-10-25 15:13:48,028 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:13:48,028 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1802 transitions.
[2023-10-25 15:13:48,033 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 28 states, 27 states have (on average 66.74074074074075) internal successors, (1802), 27 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:48,037 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 28 states, 28 states have (on average 193.0) internal successors, (5404), 28 states have internal predecessors, (5404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:48,054 INFO  L81            ComplementDD]: Finished complementDD. Result  has 28 states, 28 states have (on average 193.0) internal successors, (5404), 28 states have internal predecessors, (5404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:48,054 INFO  L175             Difference]: Start difference. First operand has 184 places, 1574 transitions, 23564 flow. Second operand 27 states and 1802 transitions.
[2023-10-25 15:13:48,054 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 2285 transitions, 37541 flow
[2023-10-25 15:13:57,807 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 2285 transitions, 37141 flow, removed 198 selfloop flow, removed 3 redundant places.
[2023-10-25 15:13:57,860 INFO  L231             Difference]: Finished difference. Result has 220 places, 1873 transitions, 30726 flow
[2023-10-25 15:13:57,874 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=23362, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=352, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1063, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=30726, PETRI_PLACES=220, PETRI_TRANSITIONS=1873}
[2023-10-25 15:13:57,876 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 158 predicate places.
[2023-10-25 15:13:57,876 INFO  L495      AbstractCegarLoop]: Abstraction has has 220 places, 1873 transitions, 30726 flow
[2023-10-25 15:13:57,885 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 54.15151515151515) internal successors, (1787), 33 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:57,885 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:13:57,885 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]
[2023-10-25 15:13:57,892 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-10-25 15:13:58,089 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2023-10-25 15:13:58,090 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:13:58,090 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:13:58,090 INFO  L85        PathProgramCache]: Analyzing trace with hash 696920881, now seen corresponding path program 3 times
[2023-10-25 15:13:58,091 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:13:58,091 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226402594]
[2023-10-25 15:13:58,091 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:13:58,091 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:13:58,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:13:58,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:13:58,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:13:58,823 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226402594]
[2023-10-25 15:13:58,823 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226402594] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:13:58,823 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714536221]
[2023-10-25 15:13:58,823 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-25 15:13:58,824 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:13:58,824 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:13:58,825 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-10-25 15:13:58,851 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-10-25 15:13:59,014 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-25 15:13:59,014 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:13:59,030 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 48 conjunts are in the unsatisfiable core
[2023-10-25 15:13:59,033 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:13:59,044 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:13:59,045 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 15
[2023-10-25 15:13:59,076 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:13:59,087 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2023-10-25 15:13:59,088 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2023-10-25 15:13:59,271 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 15:13:59,271 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-25 15:13:59,338 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-25 15:13:59,469 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-25 15:13:59,486 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-10-25 15:13:59,494 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-10-25 15:13:59,507 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:13:59,507 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-10-25 15:13:59,537 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:13:59,537 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-10-25 15:13:59,557 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:13:59,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:13:59,566 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:13:59,599 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2023-10-25 15:13:59,625 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_830 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_830 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_830 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:13:59,645 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_830) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-25 15:14:00,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:14:00,154 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714536221] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:14:00,154 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:14:00,154 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 29
[2023-10-25 15:14:00,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608610884]
[2023-10-25 15:14:00,155 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:14:00,155 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2023-10-25 15:14:00,155 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:14:00,155 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2023-10-25 15:14:00,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=660, Unknown=5, NotChecked=162, Total=930
[2023-10-25 15:14:00,247 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 43 out of 193
[2023-10-25 15:14:00,248 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 1873 transitions, 30726 flow. Second operand  has 31 states, 31 states have (on average 45.03225806451613) internal successors, (1396), 31 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:14:00,249 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:14:00,249 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 193
[2023-10-25 15:14:00,249 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:14:32,395 INFO  L130       PetriNetUnfolder]: 40361/66313 cut-off events.
[2023-10-25 15:14:32,395 INFO  L131       PetriNetUnfolder]: For 736661/736661 co-relation queries the response was YES.
[2023-10-25 15:14:32,854 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 505578 conditions, 66313 events. 40361/66313 cut-off events. For 736661/736661 co-relation queries the response was YES. Maximal size of possible extension queue 1783. Compared 524835 event pairs, 3902 based on Foata normal form. 327/66640 useless extension candidates. Maximal degree in co-relation 493981. Up to 29173 conditions per place. 
[2023-10-25 15:14:33,240 INFO  L137   encePairwiseOnDemand]: 145/193 looper letters, 3226 selfloop transitions, 1996 changer transitions 41/5265 dead transitions.
[2023-10-25 15:14:33,240 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 5265 transitions, 93197 flow
[2023-10-25 15:14:33,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2023-10-25 15:14:33,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 38 states.
[2023-10-25 15:14:33,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2303 transitions.
[2023-10-25 15:14:33,256 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.31401690755385875
[2023-10-25 15:14:33,256 INFO  L72            ComplementDD]: Start complementDD. Operand 38 states and 2303 transitions.
[2023-10-25 15:14:33,256 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 38 states and 2303 transitions.
[2023-10-25 15:14:33,257 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:14:33,257 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2303 transitions.
[2023-10-25 15:14:33,275 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 39 states, 38 states have (on average 60.60526315789474) internal successors, (2303), 38 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:14:33,279 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 39 states, 39 states have (on average 193.0) internal successors, (7527), 39 states have internal predecessors, (7527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:14:33,280 INFO  L81            ComplementDD]: Finished complementDD. Result  has 39 states, 39 states have (on average 193.0) internal successors, (7527), 39 states have internal predecessors, (7527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:14:33,280 INFO  L175             Difference]: Start difference. First operand has 220 places, 1873 transitions, 30726 flow. Second operand 38 states and 2303 transitions.
[2023-10-25 15:14:33,280 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 5265 transitions, 93197 flow
[2023-10-25 15:15:10,349 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 5265 transitions, 92608 flow, removed 162 selfloop flow, removed 10 redundant places.
[2023-10-25 15:15:10,409 INFO  L231             Difference]: Finished difference. Result has 275 places, 3635 transitions, 69175 flow
[2023-10-25 15:15:10,411 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=30425, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=507, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=756, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=69175, PETRI_PLACES=275, PETRI_TRANSITIONS=3635}
[2023-10-25 15:15:10,412 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 213 predicate places.
[2023-10-25 15:15:10,412 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 3635 transitions, 69175 flow
[2023-10-25 15:15:10,416 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 45.03225806451613) internal successors, (1396), 31 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:15:10,416 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:15:10,417 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]
[2023-10-25 15:15:10,423 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-10-25 15:15:10,621 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,SelfDestructingSolverStorable14
[2023-10-25 15:15:10,635 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:15:10,636 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:15:10,636 INFO  L85        PathProgramCache]: Analyzing trace with hash -91654295, now seen corresponding path program 4 times
[2023-10-25 15:15:10,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:15:10,636 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289471759]
[2023-10-25 15:15:10,637 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:15:10,637 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:15:10,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:15:11,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:15:11,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:15:11,469 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289471759]
[2023-10-25 15:15:11,469 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289471759] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:15:11,469 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076995276]
[2023-10-25 15:15:11,469 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-25 15:15:11,469 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:15:11,469 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:15:11,484 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-10-25 15:15:11,522 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-10-25 15:15:11,760 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-25 15:15:11,760 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:15:11,762 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 60 conjunts are in the unsatisfiable core
[2023-10-25 15:15:11,765 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:15:11,774 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:11,774 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 15
[2023-10-25 15:15:11,821 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:11,885 INFO  L321             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2023-10-25 15:15:11,886 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2023-10-25 15:15:12,068 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 15:15:12,068 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29
[2023-10-25 15:15:12,136 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2023-10-25 15:15:12,225 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-10-25 15:15:12,279 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:12,280 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-10-25 15:15:12,359 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2023-10-25 15:15:12,404 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:12,405 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:12,406 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-10-25 15:15:12,485 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 32 treesize of output 30
[2023-10-25 15:15:12,504 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 32 treesize of output 30
[2023-10-25 15:15:12,525 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 32 treesize of output 30
[2023-10-25 15:15:12,542 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 32 treesize of output 30
[2023-10-25 15:15:12,612 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:12,613 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:12,614 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:15:12,615 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-10-25 15:15:12,660 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:15:12,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:15:12,705 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:15:12,727 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_937 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2023-10-25 15:15:12,749 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_937 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2023-10-25 15:15:12,806 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_934 (Array Int Int)) (v_ArrVal_937 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_934 (Array Int Int)) (v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_934 (Array Int Int)) (v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_934 (Array Int Int)) (v_ArrVal_937 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2023-10-25 15:15:12,883 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_934 (Array Int Int)) (v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_934 (Array Int Int)) (v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse3 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_934 (Array Int Int)) (v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse5))) (forall ((v_ArrVal_934 (Array Int Int)) (v_ArrVal_937 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_934))) (store .cse6 c_threadThread1of2ForFork0_~t~0.base (store (select .cse6 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_937) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2023-10-25 15:15:13,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:15:13,483 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076995276] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:15:13,483 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:15:13,483 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 33
[2023-10-25 15:15:13,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919667197]
[2023-10-25 15:15:13,483 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:15:13,483 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2023-10-25 15:15:13,483 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:15:13,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2023-10-25 15:15:13,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=811, Unknown=18, NotChecked=244, Total=1190
[2023-10-25 15:15:13,562 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 43 out of 193
[2023-10-25 15:15:13,563 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 3635 transitions, 69175 flow. Second operand  has 35 states, 35 states have (on average 45.08571428571429) internal successors, (1578), 35 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:15:13,563 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:15:13,563 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 193
[2023-10-25 15:15:13,564 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:16:14,867 INFO  L130       PetriNetUnfolder]: 52452/85576 cut-off events.
[2023-10-25 15:16:14,867 INFO  L131       PetriNetUnfolder]: For 1693608/1693612 co-relation queries the response was YES.
[2023-10-25 15:16:15,670 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 795156 conditions, 85576 events. 52452/85576 cut-off events. For 1693608/1693612 co-relation queries the response was YES. Maximal size of possible extension queue 2267. Compared 692552 event pairs, 5211 based on Foata normal form. 84/85660 useless extension candidates. Maximal degree in co-relation 778996. Up to 55409 conditions per place. 
[2023-10-25 15:16:16,086 INFO  L137   encePairwiseOnDemand]: 152/193 looper letters, 3970 selfloop transitions, 1673 changer transitions 16/5661 dead transitions.
[2023-10-25 15:16:16,086 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 5661 transitions, 117985 flow
[2023-10-25 15:16:16,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2023-10-25 15:16:16,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2023-10-25 15:16:16,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1666 transitions.
[2023-10-25 15:16:16,088 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3082901554404145
[2023-10-25 15:16:16,088 INFO  L72            ComplementDD]: Start complementDD. Operand 28 states and 1666 transitions.
[2023-10-25 15:16:16,089 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 1666 transitions.
[2023-10-25 15:16:16,089 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:16:16,089 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1666 transitions.
[2023-10-25 15:16:16,091 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 29 states, 28 states have (on average 59.5) internal successors, (1666), 28 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:16:16,099 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 29 states, 29 states have (on average 193.0) internal successors, (5597), 29 states have internal predecessors, (5597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:16:16,101 INFO  L81            ComplementDD]: Finished complementDD. Result  has 29 states, 29 states have (on average 193.0) internal successors, (5597), 29 states have internal predecessors, (5597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:16:16,101 INFO  L175             Difference]: Start difference. First operand has 275 places, 3635 transitions, 69175 flow. Second operand 28 states and 1666 transitions.
[2023-10-25 15:16:16,101 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 5661 transitions, 117985 flow
[2023-10-25 15:18:13,433 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 5661 transitions, 116994 flow, removed 487 selfloop flow, removed 5 redundant places.
[2023-10-25 15:18:13,514 INFO  L231             Difference]: Finished difference. Result has 313 places, 4264 transitions, 89751 flow
[2023-10-25 15:18:13,526 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=68270, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1084, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=89751, PETRI_PLACES=313, PETRI_TRANSITIONS=4264}
[2023-10-25 15:18:13,534 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 251 predicate places.
[2023-10-25 15:18:13,535 INFO  L495      AbstractCegarLoop]: Abstraction has has 313 places, 4264 transitions, 89751 flow
[2023-10-25 15:18:13,535 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 45.08571428571429) internal successors, (1578), 35 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:13,535 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:13,535 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]
[2023-10-25 15:18:13,541 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-25 15:18:13,740 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-10-25 15:18:13,740 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:18:13,741 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:13,741 INFO  L85        PathProgramCache]: Analyzing trace with hash 1102210731, now seen corresponding path program 5 times
[2023-10-25 15:18:13,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:13,742 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231002895]
[2023-10-25 15:18:13,743 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:13,743 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:13,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:14,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:14,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:14,735 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231002895]
[2023-10-25 15:18:14,735 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231002895] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:18:14,735 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908693884]
[2023-10-25 15:18:14,735 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-25 15:18:14,736 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:18:14,736 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:18:14,739 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-10-25 15:18:14,797 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-10-25 15:18:14,926 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 15:18:14,926 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:18:14,927 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 47 conjunts are in the unsatisfiable core
[2023-10-25 15:18:14,933 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:18:14,947 INFO  L321             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2023-10-25 15:18:14,947 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26
[2023-10-25 15:18:14,990 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:18:14,996 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2023-10-25 15:18:14,996 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2023-10-25 15:18:15,142 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 15:18:15,142 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-25 15:18:15,200 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:18:15,201 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-10-25 15:18:15,250 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-10-25 15:18:15,322 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 24 treesize of output 12
[2023-10-25 15:18:15,363 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-10-25 15:18:15,413 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:18:15,414 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-10-25 15:18:15,462 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:18:15,463 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-10-25 15:18:15,522 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:18:15,523 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-10-25 15:18:15,546 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:18:15,546 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-10-25 15:18:15,560 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:18:15,561 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-10-25 15:18:15,588 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:18:15,589 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-10-25 15:18:15,620 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-25 15:18:15,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:15,628 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:18:15,675 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1045 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1045 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1045 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2023-10-25 15:18:15,716 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2023-10-25 15:18:15,785 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2023-10-25 15:18:15,802 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1045) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2023-10-25 15:18:16,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-10-25 15:18:16,146 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908693884] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:18:16,146 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:18:16,146 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30
[2023-10-25 15:18:16,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908264702]
[2023-10-25 15:18:16,146 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:18:16,146 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-10-25 15:18:16,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:16,147 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-10-25 15:18:16,147 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=654, Unknown=6, NotChecked=220, Total=992
[2023-10-25 15:18:16,326 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 193
[2023-10-25 15:18:16,327 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 4264 transitions, 89751 flow. Second operand  has 32 states, 32 states have (on average 54.125) internal successors, (1732), 32 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:16,327 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:16,327 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 193
[2023-10-25 15:18:16,328 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:23,317 INFO  L130       PetriNetUnfolder]: 53152/86731 cut-off events.
[2023-10-25 15:19:23,318 INFO  L131       PetriNetUnfolder]: For 2055296/2055300 co-relation queries the response was YES.
[2023-10-25 15:19:24,520 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 861934 conditions, 86731 events. 53152/86731 cut-off events. For 2055296/2055300 co-relation queries the response was YES. Maximal size of possible extension queue 2289. Compared 702830 event pairs, 5504 based on Foata normal form. 104/86835 useless extension candidates. Maximal degree in co-relation 844995. Up to 67590 conditions per place. 
[2023-10-25 15:19:24,961 INFO  L137   encePairwiseOnDemand]: 155/193 looper letters, 3199 selfloop transitions, 1916 changer transitions 9/5126 dead transitions.
[2023-10-25 15:19:24,961 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 5126 transitions, 117563 flow
[2023-10-25 15:19:24,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-25 15:19:24,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-25 15:19:24,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1702 transitions.
[2023-10-25 15:19:24,965 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3527461139896373
[2023-10-25 15:19:24,965 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1702 transitions.
[2023-10-25 15:19:24,965 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1702 transitions.
[2023-10-25 15:19:24,965 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:24,965 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1702 transitions.
[2023-10-25 15:19:24,967 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 68.08) internal successors, (1702), 25 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:24,970 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 193.0) internal successors, (5018), 26 states have internal predecessors, (5018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:24,971 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 193.0) internal successors, (5018), 26 states have internal predecessors, (5018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:24,971 INFO  L175             Difference]: Start difference. First operand has 313 places, 4264 transitions, 89751 flow. Second operand 25 states and 1702 transitions.
[2023-10-25 15:19:24,971 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 5126 transitions, 117563 flow
[2023-10-25 15:22:10,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 5126 transitions, 116659 flow, removed 394 selfloop flow, removed 9 redundant places.
[2023-10-25 15:22:10,236 INFO  L231             Difference]: Finished difference. Result has 343 places, 4649 transitions, 106333 flow
[2023-10-25 15:22:10,238 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=88917, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1549, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=106333, PETRI_PLACES=343, PETRI_TRANSITIONS=4649}
[2023-10-25 15:22:10,239 INFO  L288   CegarLoopForPetriNet]: 62 programPoint places, 281 predicate places.
[2023-10-25 15:22:10,239 INFO  L495      AbstractCegarLoop]: Abstraction has has 343 places, 4649 transitions, 106333 flow
[2023-10-25 15:22:10,239 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 54.125) internal successors, (1732), 32 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:10,239 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:10,240 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:22:10,247 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-10-25 15:22:10,444 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-10-25 15:22:10,445 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:22:10,445 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:10,446 INFO  L85        PathProgramCache]: Analyzing trace with hash 607036194, now seen corresponding path program 1 times
[2023-10-25 15:22:10,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:10,446 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255004689]
[2023-10-25 15:22:10,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:10,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:10,467 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:11,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:11,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:11,116 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255004689]
[2023-10-25 15:22:11,116 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255004689] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:22:11,116 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932191837]
[2023-10-25 15:22:11,116 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:11,116 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:22:11,116 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:22:11,117 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-10-25 15:22:11,151 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-10-25 15:22:11,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:11,318 INFO  L263         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-10-25 15:22:11,320 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:22:11,333 INFO  L321             Elim1Store]: treesize reduction 23, result has 17.9 percent of original size
[2023-10-25 15:22:11,333 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26
[2023-10-25 15:22:11,365 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:22:11,377 INFO  L321             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2023-10-25 15:22:11,377 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2023-10-25 15:22:11,526 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2023-10-25 15:22:11,527 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2023-10-25 15:22:11,572 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:22:11,573 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-10-25 15:22:11,647 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 24 treesize of output 12
[2023-10-25 15:22:11,672 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:22:11,681 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:22:11,709 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:22:11,709 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:22:11,722 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:22:11,722 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:22:11,735 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:22:11,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:11,743 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:22:11,773 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)))) is different from false
[2023-10-25 15:22:12,027 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2 0) (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1) 0)))) (and (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1153 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2))) (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1)) 0)))))) is different from false
[2023-10-25 15:22:12,039 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse2)) (.cse3 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 0) .cse3 0) (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2) 0)))) (and (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1) 0)) (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3) 0)))))) is different from false
[2023-10-25 15:22:12,053 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:22:12,053 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 51 treesize of output 67
[2023-10-25 15:22:12,072 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:22:12,072 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 83 treesize of output 39
[2023-10-25 15:22:12,081 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 15:22:12,082 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 51 treesize of output 1
[2023-10-25 15:22:12,087 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 15:22:12,087 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 50 treesize of output 1
[2023-10-25 15:22:12,156 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1144) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2023-10-25 15:22:12,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:12,361 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [932191837] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:22:12,361 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:22:12,361 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 26
[2023-10-25 15:22:12,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121537376]
[2023-10-25 15:22:12,362 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:22:12,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2023-10-25 15:22:12,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:12,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2023-10-25 15:22:12,362 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=457, Unknown=24, NotChecked=188, Total=756
[2023-10-25 15:22:12,547 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 193
[2023-10-25 15:22:12,548 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 4649 transitions, 106333 flow. Second operand  has 28 states, 28 states have (on average 51.07142857142857) internal successors, (1430), 28 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:12,548 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:12,548 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 193
[2023-10-25 15:22:12,548 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
