./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-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bf7b579398dce65888a9d1c64f7ca367e99603e81f845cd2926f3955a32b276
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 22:38:06,583 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 22:38:06,585 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 22:38:06,605 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 22:38:06,605 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 22:38:06,606 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 22:38:06,607 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 22:38:06,608 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 22:38:06,609 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 22:38:06,609 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 22:38:06,610 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 22:38:06,611 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 22:38:06,611 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 22:38:06,612 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 22:38:06,612 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 22:38:06,613 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 22:38:06,614 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 22:38:06,614 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 22:38:06,615 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 22:38:06,616 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 22:38:06,617 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 22:38:06,618 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 22:38:06,619 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 22:38:06,620 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 22:38:06,622 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 22:38:06,622 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 22:38:06,622 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 22:38:06,623 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 22:38:06,624 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 22:38:06,624 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 22:38:06,624 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 22:38:06,625 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 22:38:06,625 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 22:38:06,626 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 22:38:06,626 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 22:38:06,627 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 22:38:06,627 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 22:38:06,627 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 22:38:06,627 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 22:38:06,628 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 22:38:06,628 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 22:38:06,629 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 22:38:06,645 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 22:38:06,645 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 22:38:06,645 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 22:38:06,646 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 22:38:06,649 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 22:38:06,650 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 22:38:06,650 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 22:38:06,651 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 22:38:06,651 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 22:38:06,651 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 22:38:06,651 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 22:38:06,652 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 22:38:06,652 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 22:38:06,652 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 22:38:06,652 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 22:38:06,653 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 22:38:06,653 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 22:38:06,653 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 22:38:06,653 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 22:38:06,653 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 22:38:06,654 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 22:38:06,654 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 22:38:06,654 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 22:38:06,654 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 22:38:06,654 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 22:38:06,655 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 22:38:06,655 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:38:06,655 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 22:38:06,655 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 22:38:06,656 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 22:38:06,656 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 22:38:06,656 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 22:38:06,656 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 22:38:06,656 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 22:38:06,657 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 22:38:06,657 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 22:38:06,657 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 22:38:06,657 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 -> 3bf7b579398dce65888a9d1c64f7ca367e99603e81f845cd2926f3955a32b276
[2024-03-11 22:38:06,831 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 22:38:06,854 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 22:38:06,856 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 22:38:06,857 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 22:38:06,865 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 22:38:06,868 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2024-03-11 22:38:07,867 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 22:38:08,091 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 22:38:08,091 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2024-03-11 22:38:08,101 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/cc7161f0e/6eb70abfc7184cb58d943e88c76cf395/FLAGa36e7c329
[2024-03-11 22:38:08,111 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/cc7161f0e/6eb70abfc7184cb58d943e88c76cf395
[2024-03-11 22:38:08,113 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 22:38:08,114 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 22:38:08,115 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 22:38:08,115 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 22:38:08,118 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 22:38:08,118 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,119 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709ff2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08, skipping insertion in model container
[2024-03-11 22:38:08,120 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,125 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 22:38:08,157 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 22:38:08,266 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:38:08,411 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:38:08,417 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 22:38:08,427 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:38:08,447 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:38:08,498 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 22:38:08,499 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08 WrapperNode
[2024-03-11 22:38:08,499 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 22:38:08,500 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 22:38:08,500 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 22:38:08,500 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 22:38:08,505 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,519 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,536 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78
[2024-03-11 22:38:08,536 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 22:38:08,537 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 22:38:08,537 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 22:38:08,538 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 22:38:08,545 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,545 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,548 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,548 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,555 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,558 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,559 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,561 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,563 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 22:38:08,564 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 22:38:08,564 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 22:38:08,564 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 22:38:08,565 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (1/1) ...
[2024-03-11 22:38:08,570 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:38:08,577 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:38:08,588 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-11 22:38:08,592 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-11 22:38:08,627 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 22:38:08,627 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 22:38:08,628 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 22:38:08,628 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-11 22:38:08,628 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 22:38:08,629 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 22:38:08,629 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 22:38:08,629 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 22:38:08,630 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 22:38:08,630 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 22:38:08,631 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 22:38:08,632 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 22:38:08,747 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 22:38:08,748 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 22:38:08,918 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 22:38:08,924 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 22:38:08,924 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 22:38:08,926 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:38:08 BoogieIcfgContainer
[2024-03-11 22:38:08,926 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 22:38:08,928 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 22:38:08,928 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 22:38:08,930 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 22:38:08,931 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 10:38:08" (1/3) ...
[2024-03-11 22:38:08,931 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51134c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:38:08, skipping insertion in model container
[2024-03-11 22:38:08,931 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:38:08" (2/3) ...
[2024-03-11 22:38:08,932 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51134c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:38:08, skipping insertion in model container
[2024-03-11 22:38:08,932 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:38:08" (3/3) ...
[2024-03-11 22:38:08,933 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i
[2024-03-11 22:38:08,940 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 22:38:08,947 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 22:38:08,948 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-03-11 22:38:08,948 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 22:38:08,989 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 22:38:09,018 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2024-03-11 22:38:09,064 INFO  L130       PetriNetUnfolder]: 6/150 cut-off events.
[2024-03-11 22:38:09,065 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:38:09,069 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156 conditions, 150 events. 6/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 293 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. 
[2024-03-11 22:38:09,069 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 214 flow
[2024-03-11 22:38:09,073 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 214 flow
[2024-03-11 22:38:09,075 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:38:09,083 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 103 transitions, 214 flow
[2024-03-11 22:38:09,085 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 103 transitions, 214 flow
[2024-03-11 22:38:09,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2024-03-11 22:38:09,113 INFO  L130       PetriNetUnfolder]: 6/150 cut-off events.
[2024-03-11 22:38:09,113 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:38:09,114 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156 conditions, 150 events. 6/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 293 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. 
[2024-03-11 22:38:09,115 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1620
[2024-03-11 22:38:11,050 INFO  L134        LiptonReduction]: Checked pairs total: 7037
[2024-03-11 22:38:11,050 INFO  L136        LiptonReduction]: Total number of compositions: 70
[2024-03-11 22:38:11,077 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:38:11,082 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;@43962205, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:38:11,083 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-11 22:38:11,086 INFO  L130       PetriNetUnfolder]: 0/17 cut-off events.
[2024-03-11 22:38:11,086 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:38:11,086 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:11,087 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:38:11,087 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:38:11,091 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:11,091 INFO  L85        PathProgramCache]: Analyzing trace with hash -2131258833, now seen corresponding path program 1 times
[2024-03-11 22:38:11,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:11,097 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723095936]
[2024-03-11 22:38:11,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:11,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:11,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:11,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:11,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:11,504 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723095936]
[2024-03-11 22:38:11,504 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723095936] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:38:11,505 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:38:11,505 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:38:11,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628738282]
[2024-03-11 22:38:11,506 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:38:11,512 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:38:11,512 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:38:11,527 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:38:11,528 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:38:11,744 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 173
[2024-03-11 22:38:11,748 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 94 flow. Second operand  has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:11,748 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:38:11,748 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 173
[2024-03-11 22:38:11,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:38:11,986 INFO  L130       PetriNetUnfolder]: 181/536 cut-off events.
[2024-03-11 22:38:11,987 INFO  L131       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2024-03-11 22:38:11,988 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 994 conditions, 536 events. 181/536 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2875 event pairs, 42 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 895. Up to 266 conditions per place. 
[2024-03-11 22:38:11,991 INFO  L137   encePairwiseOnDemand]: 151/173 looper letters, 54 selfloop transitions, 28 changer transitions 0/92 dead transitions.
[2024-03-11 22:38:11,992 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 92 transitions, 359 flow
[2024-03-11 22:38:11,993 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:38:11,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:38:12,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions.
[2024-03-11 22:38:12,005 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5038535645472062
[2024-03-11 22:38:12,006 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 523 transitions.
[2024-03-11 22:38:12,006 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 523 transitions.
[2024-03-11 22:38:12,008 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:38:12,010 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 523 transitions.
[2024-03-11 22:38:12,015 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:12,020 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:12,021 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:12,023 INFO  L175             Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 6 states and 523 transitions.
[2024-03-11 22:38:12,025 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 92 transitions, 359 flow
[2024-03-11 22:38:12,029 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 359 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:38:12,033 INFO  L231             Difference]: Finished difference. Result has 55 places, 71 transitions, 306 flow
[2024-03-11 22:38:12,034 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=55, PETRI_TRANSITIONS=71}
[2024-03-11 22:38:12,037 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places.
[2024-03-11 22:38:12,037 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 71 transitions, 306 flow
[2024-03-11 22:38:12,038 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:12,038 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:12,038 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:38:12,038 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 22:38:12,038 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:38:12,039 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:12,039 INFO  L85        PathProgramCache]: Analyzing trace with hash -1539485806, now seen corresponding path program 1 times
[2024-03-11 22:38:12,039 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:12,040 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779390509]
[2024-03-11 22:38:12,040 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:12,040 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:12,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:12,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:12,255 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:12,256 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779390509]
[2024-03-11 22:38:12,256 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779390509] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:38:12,256 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:38:12,256 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:38:12,256 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227475161]
[2024-03-11 22:38:12,257 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:38:12,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:38:12,258 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:38:12,258 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:38:12,258 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:38:12,505 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 173
[2024-03-11 22:38:12,506 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 71 transitions, 306 flow. Second operand  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:12,506 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:38:12,506 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 173
[2024-03-11 22:38:12,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:38:12,691 INFO  L130       PetriNetUnfolder]: 182/561 cut-off events.
[2024-03-11 22:38:12,692 INFO  L131       PetriNetUnfolder]: For 252/254 co-relation queries the response was YES.
[2024-03-11 22:38:12,694 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 561 events. 182/561 cut-off events. For 252/254 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3049 event pairs, 36 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 1293. Up to 276 conditions per place. 
[2024-03-11 22:38:12,696 INFO  L137   encePairwiseOnDemand]: 162/173 looper letters, 37 selfloop transitions, 33 changer transitions 8/113 dead transitions.
[2024-03-11 22:38:12,696 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 113 transitions, 637 flow
[2024-03-11 22:38:12,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:38:12,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:38:12,700 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 551 transitions.
[2024-03-11 22:38:12,701 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5308285163776493
[2024-03-11 22:38:12,701 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 551 transitions.
[2024-03-11 22:38:12,701 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 551 transitions.
[2024-03-11 22:38:12,701 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:38:12,701 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 551 transitions.
[2024-03-11 22:38:12,703 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:12,705 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:12,705 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:12,705 INFO  L175             Difference]: Start difference. First operand has 55 places, 71 transitions, 306 flow. Second operand 6 states and 551 transitions.
[2024-03-11 22:38:12,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 113 transitions, 637 flow
[2024-03-11 22:38:12,709 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 637 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:38:12,710 INFO  L231             Difference]: Finished difference. Result has 65 places, 101 transitions, 607 flow
[2024-03-11 22:38:12,711 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=607, PETRI_PLACES=65, PETRI_TRANSITIONS=101}
[2024-03-11 22:38:12,711 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places.
[2024-03-11 22:38:12,712 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 101 transitions, 607 flow
[2024-03-11 22:38:12,712 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:12,712 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:12,712 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:38:12,713 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 22:38:12,713 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:38:12,713 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:12,713 INFO  L85        PathProgramCache]: Analyzing trace with hash 262130902, now seen corresponding path program 1 times
[2024-03-11 22:38:12,714 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:12,714 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041511133]
[2024-03-11 22:38:12,714 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:12,714 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:12,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:12,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:12,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:12,934 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041511133]
[2024-03-11 22:38:12,934 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041511133] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:38:12,934 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:38:12,934 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:38:12,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547356557]
[2024-03-11 22:38:12,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:38:12,935 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:38:12,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:38:12,936 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:38:12,936 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:38:13,009 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 173
[2024-03-11 22:38:13,010 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 101 transitions, 607 flow. Second operand  has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:13,011 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:38:13,011 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 173
[2024-03-11 22:38:13,011 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:38:13,339 INFO  L130       PetriNetUnfolder]: 316/822 cut-off events.
[2024-03-11 22:38:13,340 INFO  L131       PetriNetUnfolder]: For 647/655 co-relation queries the response was YES.
[2024-03-11 22:38:13,342 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 822 events. 316/822 cut-off events. For 647/655 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4796 event pairs, 49 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 2572. Up to 579 conditions per place. 
[2024-03-11 22:38:13,345 INFO  L137   encePairwiseOnDemand]: 151/173 looper letters, 100 selfloop transitions, 76 changer transitions 10/199 dead transitions.
[2024-03-11 22:38:13,345 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 199 transitions, 1391 flow
[2024-03-11 22:38:13,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:38:13,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:38:13,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions.
[2024-03-11 22:38:13,348 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5414258188824663
[2024-03-11 22:38:13,348 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 562 transitions.
[2024-03-11 22:38:13,348 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 562 transitions.
[2024-03-11 22:38:13,348 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:38:13,348 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 562 transitions.
[2024-03-11 22:38:13,350 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:13,352 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:13,352 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:13,352 INFO  L175             Difference]: Start difference. First operand has 65 places, 101 transitions, 607 flow. Second operand 6 states and 562 transitions.
[2024-03-11 22:38:13,352 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 199 transitions, 1391 flow
[2024-03-11 22:38:13,358 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 199 transitions, 1391 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:38:13,360 INFO  L231             Difference]: Finished difference. Result has 73 places, 169 transitions, 1207 flow
[2024-03-11 22:38:13,360 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1207, PETRI_PLACES=73, PETRI_TRANSITIONS=169}
[2024-03-11 22:38:13,361 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places.
[2024-03-11 22:38:13,361 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 169 transitions, 1207 flow
[2024-03-11 22:38:13,361 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:13,362 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:13,362 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-11 22:38:13,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 22:38:13,362 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-11 22:38:13,362 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:13,363 INFO  L85        PathProgramCache]: Analyzing trace with hash 62906132, now seen corresponding path program 1 times
[2024-03-11 22:38:13,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:13,363 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770476497]
[2024-03-11 22:38:13,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:13,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:13,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:38:13,400 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:38:13,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:38:13,429 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:38:13,429 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:38:13,430 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-11 22:38:13,431 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-11 22:38:13,431 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-11 22:38:13,432 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-11 22:38:13,432 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-11 22:38:13,432 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-11 22:38:13,432 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-11 22:38:13,433 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 22:38:13,433 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-11 22:38:13,435 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:38:13,435 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 22:38:13,449 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 22:38:13,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 120 transitions, 258 flow
[2024-03-11 22:38:13,468 INFO  L130       PetriNetUnfolder]: 11/265 cut-off events.
[2024-03-11 22:38:13,468 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:38:13,469 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 279 conditions, 265 events. 11/265 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 614 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. 
[2024-03-11 22:38:13,469 INFO  L82        GeneralOperation]: Start removeDead. Operand has 120 places, 120 transitions, 258 flow
[2024-03-11 22:38:13,470 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 120 places, 120 transitions, 258 flow
[2024-03-11 22:38:13,470 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:38:13,470 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 120 transitions, 258 flow
[2024-03-11 22:38:13,470 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 120 transitions, 258 flow
[2024-03-11 22:38:13,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 120 transitions, 258 flow
[2024-03-11 22:38:13,485 INFO  L130       PetriNetUnfolder]: 11/265 cut-off events.
[2024-03-11 22:38:13,486 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:38:13,486 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 279 conditions, 265 events. 11/265 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 614 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. 
[2024-03-11 22:38:13,489 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4080
[2024-03-11 22:38:15,422 INFO  L134        LiptonReduction]: Checked pairs total: 17877
[2024-03-11 22:38:15,423 INFO  L136        LiptonReduction]: Total number of compositions: 72
[2024-03-11 22:38:15,425 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:38:15,427 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;@43962205, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:38:15,427 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-11 22:38:15,430 INFO  L130       PetriNetUnfolder]: 0/17 cut-off events.
[2024-03-11 22:38:15,430 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:38:15,430 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:15,430 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:38:15,431 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:38:15,431 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:15,431 INFO  L85        PathProgramCache]: Analyzing trace with hash 629147434, now seen corresponding path program 1 times
[2024-03-11 22:38:15,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:15,432 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831937252]
[2024-03-11 22:38:15,432 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:15,432 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:15,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:15,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:15,591 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:15,591 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831937252]
[2024-03-11 22:38:15,591 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831937252] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:38:15,591 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:38:15,592 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:38:15,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767373082]
[2024-03-11 22:38:15,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:38:15,592 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:38:15,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:38:15,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:38:15,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:38:15,827 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192
[2024-03-11 22:38:15,828 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 126 flow. Second operand  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:15,828 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:38:15,828 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192
[2024-03-11 22:38:15,828 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:38:16,479 INFO  L130       PetriNetUnfolder]: 3686/6983 cut-off events.
[2024-03-11 22:38:16,479 INFO  L131       PetriNetUnfolder]: For 206/241 co-relation queries the response was YES.
[2024-03-11 22:38:16,484 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13338 conditions, 6983 events. 3686/6983 cut-off events. For 206/241 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 47160 event pairs, 884 based on Foata normal form. 12/6616 useless extension candidates. Maximal degree in co-relation 6457. Up to 4233 conditions per place. 
[2024-03-11 22:38:16,503 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 75 selfloop transitions, 47 changer transitions 0/135 dead transitions.
[2024-03-11 22:38:16,503 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 135 transitions, 543 flow
[2024-03-11 22:38:16,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:38:16,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:38:16,505 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions.
[2024-03-11 22:38:16,505 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5460069444444444
[2024-03-11 22:38:16,505 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 629 transitions.
[2024-03-11 22:38:16,506 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions.
[2024-03-11 22:38:16,506 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:38:16,506 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions.
[2024-03-11 22:38:16,507 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:16,509 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:16,509 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:16,509 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 126 flow. Second operand 6 states and 629 transitions.
[2024-03-11 22:38:16,509 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 135 transitions, 543 flow
[2024-03-11 22:38:16,510 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 135 transitions, 543 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:38:16,512 INFO  L231             Difference]: Finished difference. Result has 67 places, 101 transitions, 460 flow
[2024-03-11 22:38:16,512 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=67, PETRI_TRANSITIONS=101}
[2024-03-11 22:38:16,513 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places.
[2024-03-11 22:38:16,513 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 460 flow
[2024-03-11 22:38:16,513 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:16,513 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:16,513 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:38:16,513 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 22:38:16,513 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:38:16,514 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:16,514 INFO  L85        PathProgramCache]: Analyzing trace with hash -1562642498, now seen corresponding path program 1 times
[2024-03-11 22:38:16,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:16,514 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588657485]
[2024-03-11 22:38:16,514 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:16,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:16,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:16,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:16,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:16,703 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588657485]
[2024-03-11 22:38:16,703 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588657485] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:38:16,703 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:38:16,703 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:38:16,703 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586343603]
[2024-03-11 22:38:16,703 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:38:16,704 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:38:16,704 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:38:16,704 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:38:16,704 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:38:16,910 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 192
[2024-03-11 22:38:16,911 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 460 flow. Second operand  has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:16,911 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:38:16,911 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 192
[2024-03-11 22:38:16,911 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:38:17,617 INFO  L130       PetriNetUnfolder]: 3875/7372 cut-off events.
[2024-03-11 22:38:17,617 INFO  L131       PetriNetUnfolder]: For 4540/4665 co-relation queries the response was YES.
[2024-03-11 22:38:17,626 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19732 conditions, 7372 events. 3875/7372 cut-off events. For 4540/4665 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 50170 event pairs, 1160 based on Foata normal form. 0/6968 useless extension candidates. Maximal degree in co-relation 10705. Up to 4740 conditions per place. 
[2024-03-11 22:38:17,652 INFO  L137   encePairwiseOnDemand]: 177/192 looper letters, 81 selfloop transitions, 70 changer transitions 0/188 dead transitions.
[2024-03-11 22:38:17,652 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 188 transitions, 1134 flow
[2024-03-11 22:38:17,654 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:38:17,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:38:17,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions.
[2024-03-11 22:38:17,655 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5651041666666666
[2024-03-11 22:38:17,655 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 651 transitions.
[2024-03-11 22:38:17,655 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions.
[2024-03-11 22:38:17,656 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:38:17,656 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions.
[2024-03-11 22:38:17,657 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)
[2024-03-11 22:38:17,658 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:17,659 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:17,659 INFO  L175             Difference]: Start difference. First operand has 67 places, 101 transitions, 460 flow. Second operand 6 states and 651 transitions.
[2024-03-11 22:38:17,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 188 transitions, 1134 flow
[2024-03-11 22:38:17,666 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 188 transitions, 1134 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:38:17,668 INFO  L231             Difference]: Finished difference. Result has 77 places, 170 transitions, 1114 flow
[2024-03-11 22:38:17,668 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1114, PETRI_PLACES=77, PETRI_TRANSITIONS=170}
[2024-03-11 22:38:17,669 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2024-03-11 22:38:17,669 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 170 transitions, 1114 flow
[2024-03-11 22:38:17,669 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:17,670 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:17,670 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:38:17,670 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 22:38:17,670 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:38:17,670 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:17,670 INFO  L85        PathProgramCache]: Analyzing trace with hash -52118358, now seen corresponding path program 1 times
[2024-03-11 22:38:17,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:17,670 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967511643]
[2024-03-11 22:38:17,671 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:17,671 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:17,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:17,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:17,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:17,834 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967511643]
[2024-03-11 22:38:17,834 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967511643] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:38:17,834 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:38:17,834 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:38:17,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933485255]
[2024-03-11 22:38:17,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:38:17,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:38:17,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:38:17,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:38:17,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:38:17,961 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192
[2024-03-11 22:38:17,961 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 170 transitions, 1114 flow. Second operand  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:17,962 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:38:17,962 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192
[2024-03-11 22:38:17,962 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:38:19,147 INFO  L130       PetriNetUnfolder]: 6828/12078 cut-off events.
[2024-03-11 22:38:19,147 INFO  L131       PetriNetUnfolder]: For 11484/11568 co-relation queries the response was YES.
[2024-03-11 22:38:19,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40089 conditions, 12078 events. 6828/12078 cut-off events. For 11484/11568 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 82857 event pairs, 1685 based on Foata normal form. 0/11340 useless extension candidates. Maximal degree in co-relation 33299. Up to 9361 conditions per place. 
[2024-03-11 22:38:19,202 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 184 selfloop transitions, 147 changer transitions 0/348 dead transitions.
[2024-03-11 22:38:19,202 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 348 transitions, 2660 flow
[2024-03-11 22:38:19,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:38:19,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:38:19,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 674 transitions.
[2024-03-11 22:38:19,204 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5850694444444444
[2024-03-11 22:38:19,204 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 674 transitions.
[2024-03-11 22:38:19,205 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 674 transitions.
[2024-03-11 22:38:19,205 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:38:19,205 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 674 transitions.
[2024-03-11 22:38:19,206 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:19,208 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:19,208 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:19,208 INFO  L175             Difference]: Start difference. First operand has 77 places, 170 transitions, 1114 flow. Second operand 6 states and 674 transitions.
[2024-03-11 22:38:19,208 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 348 transitions, 2660 flow
[2024-03-11 22:38:19,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 348 transitions, 2660 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:38:19,231 INFO  L231             Difference]: Finished difference. Result has 86 places, 304 transitions, 2404 flow
[2024-03-11 22:38:19,231 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2404, PETRI_PLACES=86, PETRI_TRANSITIONS=304}
[2024-03-11 22:38:19,231 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places.
[2024-03-11 22:38:19,232 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 304 transitions, 2404 flow
[2024-03-11 22:38:19,232 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:19,232 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:19,232 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:38:19,232 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 22:38:19,232 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:38:19,233 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:19,233 INFO  L85        PathProgramCache]: Analyzing trace with hash -1215569579, now seen corresponding path program 1 times
[2024-03-11 22:38:19,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:19,233 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228811932]
[2024-03-11 22:38:19,233 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:19,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:19,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:19,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:19,568 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:19,568 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228811932]
[2024-03-11 22:38:19,568 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228811932] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:38:19,569 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264447445]
[2024-03-11 22:38:19,569 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:19,569 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:38:19,569 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:38:19,571 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:38:19,574 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-11 22:38:19,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:19,663 INFO  L263         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjunts are in the unsatisfiable core
[2024-03-11 22:38:19,666 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:38:19,772 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:38:19,798 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
[2024-03-11 22:38:19,830 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:38:19,830 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
[2024-03-11 22:38:19,875 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:38:19,875 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
[2024-03-11 22:38:19,959 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:19,961 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:38:19,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:19,973 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:38:20,000 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-11 22:38:20,025 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_282 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-11 22:38:20,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:38:20,140 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [264447445] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:38:20,140 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:38:20,140 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20
[2024-03-11 22:38:20,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023417998]
[2024-03-11 22:38:20,141 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:38:20,141 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2024-03-11 22:38:20,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:38:20,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-03-11 22:38:20,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=301, Unknown=2, NotChecked=74, Total=462
[2024-03-11 22:38:20,169 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 192
[2024-03-11 22:38:20,170 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 304 transitions, 2404 flow. Second operand  has 22 states, 22 states have (on average 62.27272727272727) internal successors, (1370), 22 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:20,170 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:38:20,170 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 192
[2024-03-11 22:38:20,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:38:23,672 INFO  L130       PetriNetUnfolder]: 11359/18832 cut-off events.
[2024-03-11 22:38:23,673 INFO  L131       PetriNetUnfolder]: For 32117/32119 co-relation queries the response was YES.
[2024-03-11 22:38:23,706 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75968 conditions, 18832 events. 11359/18832 cut-off events. For 32117/32119 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 128274 event pairs, 1116 based on Foata normal form. 2/17121 useless extension candidates. Maximal degree in co-relation 66241. Up to 10934 conditions per place. 
[2024-03-11 22:38:23,770 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 523 selfloop transitions, 331 changer transitions 19/878 dead transitions.
[2024-03-11 22:38:23,771 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 878 transitions, 7634 flow
[2024-03-11 22:38:23,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-03-11 22:38:23,771 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-03-11 22:38:23,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1166 transitions.
[2024-03-11 22:38:23,774 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4671474358974359
[2024-03-11 22:38:23,774 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1166 transitions.
[2024-03-11 22:38:23,774 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1166 transitions.
[2024-03-11 22:38:23,775 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:38:23,775 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1166 transitions.
[2024-03-11 22:38:23,777 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 89.6923076923077) internal successors, (1166), 13 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:23,779 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 192.0) internal successors, (2688), 14 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:23,780 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 192.0) internal successors, (2688), 14 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:23,780 INFO  L175             Difference]: Start difference. First operand has 86 places, 304 transitions, 2404 flow. Second operand 13 states and 1166 transitions.
[2024-03-11 22:38:23,780 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 878 transitions, 7634 flow
[2024-03-11 22:38:24,156 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 878 transitions, 7490 flow, removed 72 selfloop flow, removed 0 redundant places.
[2024-03-11 22:38:24,164 INFO  L231             Difference]: Finished difference. Result has 108 places, 587 transitions, 5820 flow
[2024-03-11 22:38:24,164 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5820, PETRI_PLACES=108, PETRI_TRANSITIONS=587}
[2024-03-11 22:38:24,164 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 51 predicate places.
[2024-03-11 22:38:24,165 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 587 transitions, 5820 flow
[2024-03-11 22:38:24,165 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 62.27272727272727) internal successors, (1370), 22 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:24,165 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:24,165 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:38:24,175 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-03-11 22:38:24,366 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
[2024-03-11 22:38:24,368 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:38:24,369 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:24,369 INFO  L85        PathProgramCache]: Analyzing trace with hash 198304269, now seen corresponding path program 1 times
[2024-03-11 22:38:24,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:24,370 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281561941]
[2024-03-11 22:38:24,370 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:24,371 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:24,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:24,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:24,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:24,655 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281561941]
[2024-03-11 22:38:24,655 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281561941] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:38:24,655 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270565476]
[2024-03-11 22:38:24,655 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:24,655 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:38:24,656 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:38:24,657 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:38:24,658 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-11 22:38:24,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:24,783 INFO  L263         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core
[2024-03-11 22:38:24,786 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:38:24,874 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:38:24,905 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:24,906 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:38:24,957 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:24,959 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:24,961 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:38:25,022 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:25,023 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:25,024 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:25,025 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:38:25,124 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:25,126 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:38:25,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:25,159 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:38:25,179 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2024-03-11 22:38:25,701 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33) (forall ((v_ArrVal_369 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))))) (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33)))))) is different from false
[2024-03-11 22:38:25,731 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33))) (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))))) is different from false
[2024-03-11 22:38:25,767 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:38:25,767 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2024-03-11 22:38:25,774 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:38:25,774 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2024-03-11 22:38:25,778 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2024-03-11 22:38:25,786 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:38:25,787 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:38:25,792 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:38:25,793 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:38:25,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-11 22:38:25,847 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270565476] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:38:25,847 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:38:25,847 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23
[2024-03-11 22:38:25,848 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082200965]
[2024-03-11 22:38:25,848 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:38:25,848 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-03-11 22:38:25,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:38:25,849 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-03-11 22:38:25,849 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=345, Unknown=16, NotChecked=126, Total=600
[2024-03-11 22:38:25,850 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 192
[2024-03-11 22:38:25,852 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 587 transitions, 5820 flow. Second operand  has 25 states, 25 states have (on average 66.0) internal successors, (1650), 25 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:25,852 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:38:25,852 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 192
[2024-03-11 22:38:25,852 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:38:31,456 INFO  L130       PetriNetUnfolder]: 13413/22841 cut-off events.
[2024-03-11 22:38:31,456 INFO  L131       PetriNetUnfolder]: For 88899/88942 co-relation queries the response was YES.
[2024-03-11 22:38:31,515 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 126166 conditions, 22841 events. 13413/22841 cut-off events. For 88899/88942 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 162494 event pairs, 787 based on Foata normal form. 214/21628 useless extension candidates. Maximal degree in co-relation 118313. Up to 11114 conditions per place. 
[2024-03-11 22:38:31,598 INFO  L137   encePairwiseOnDemand]: 146/192 looper letters, 778 selfloop transitions, 426 changer transitions 12/1225 dead transitions.
[2024-03-11 22:38:31,598 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 1225 transitions, 14081 flow
[2024-03-11 22:38:31,599 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-03-11 22:38:31,599 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-03-11 22:38:31,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1071 transitions.
[2024-03-11 22:38:31,601 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46484375
[2024-03-11 22:38:31,601 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1071 transitions.
[2024-03-11 22:38:31,601 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1071 transitions.
[2024-03-11 22:38:31,602 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:38:31,602 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1071 transitions.
[2024-03-11 22:38:31,603 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 89.25) internal successors, (1071), 12 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:31,606 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:31,606 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:31,606 INFO  L175             Difference]: Start difference. First operand has 108 places, 587 transitions, 5820 flow. Second operand 12 states and 1071 transitions.
[2024-03-11 22:38:31,606 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 1225 transitions, 14081 flow
[2024-03-11 22:38:32,873 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 1225 transitions, 13849 flow, removed 114 selfloop flow, removed 1 redundant places.
[2024-03-11 22:38:32,887 INFO  L231             Difference]: Finished difference. Result has 127 places, 884 transitions, 10771 flow
[2024-03-11 22:38:32,887 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=5662, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10771, PETRI_PLACES=127, PETRI_TRANSITIONS=884}
[2024-03-11 22:38:32,888 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 70 predicate places.
[2024-03-11 22:38:32,888 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 884 transitions, 10771 flow
[2024-03-11 22:38:32,889 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 66.0) internal successors, (1650), 25 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:32,889 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:32,889 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]
[2024-03-11 22:38:32,896 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-11 22:38:33,090 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
[2024-03-11 22:38:33,090 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:38:33,091 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:33,091 INFO  L85        PathProgramCache]: Analyzing trace with hash -1497011703, now seen corresponding path program 1 times
[2024-03-11 22:38:33,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:33,092 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939186290]
[2024-03-11 22:38:33,092 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:33,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:33,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:33,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:33,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:33,167 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939186290]
[2024-03-11 22:38:33,167 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939186290] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:38:33,167 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094718234]
[2024-03-11 22:38:33,167 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:33,167 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:38:33,168 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:38:33,168 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:38:33,172 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-11 22:38:33,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:33,296 INFO  L263         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-11 22:38:33,297 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:38:33,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:33,324 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:38:33,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:33,356 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094718234] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:38:33,356 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:38:33,356 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2024-03-11 22:38:33,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560985789]
[2024-03-11 22:38:33,357 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:38:33,357 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-11 22:38:33,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:38:33,357 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-11 22:38:33,358 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-03-11 22:38:33,464 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 192
[2024-03-11 22:38:33,465 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 884 transitions, 10771 flow. Second operand  has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:33,465 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:38:33,465 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 192
[2024-03-11 22:38:33,465 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:38:36,222 INFO  L130       PetriNetUnfolder]: 9213/17239 cut-off events.
[2024-03-11 22:38:36,222 INFO  L131       PetriNetUnfolder]: For 100894/102768 co-relation queries the response was YES.
[2024-03-11 22:38:36,297 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 96631 conditions, 17239 events. 9213/17239 cut-off events. For 100894/102768 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 131197 event pairs, 1087 based on Foata normal form. 246/16928 useless extension candidates. Maximal degree in co-relation 90860. Up to 5825 conditions per place. 
[2024-03-11 22:38:36,370 INFO  L137   encePairwiseOnDemand]: 186/192 looper letters, 202 selfloop transitions, 14 changer transitions 29/930 dead transitions.
[2024-03-11 22:38:36,371 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 930 transitions, 11897 flow
[2024-03-11 22:38:36,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-11 22:38:36,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-11 22:38:36,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 757 transitions.
[2024-03-11 22:38:36,373 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5632440476190477
[2024-03-11 22:38:36,373 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 757 transitions.
[2024-03-11 22:38:36,374 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 757 transitions.
[2024-03-11 22:38:36,374 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:38:36,374 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 757 transitions.
[2024-03-11 22:38:36,375 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 108.14285714285714) internal successors, (757), 7 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:36,377 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:36,377 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:36,377 INFO  L175             Difference]: Start difference. First operand has 127 places, 884 transitions, 10771 flow. Second operand 7 states and 757 transitions.
[2024-03-11 22:38:36,377 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 930 transitions, 11897 flow
[2024-03-11 22:38:37,335 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 930 transitions, 11805 flow, removed 45 selfloop flow, removed 1 redundant places.
[2024-03-11 22:38:37,346 INFO  L231             Difference]: Finished difference. Result has 135 places, 829 transitions, 10196 flow
[2024-03-11 22:38:37,347 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=10342, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=847, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=833, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10196, PETRI_PLACES=135, PETRI_TRANSITIONS=829}
[2024-03-11 22:38:37,347 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 78 predicate places.
[2024-03-11 22:38:37,347 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 829 transitions, 10196 flow
[2024-03-11 22:38:37,348 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:37,348 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:37,348 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:38:37,352 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-11 22:38:37,552 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,SelfDestructingSolverStorable9
[2024-03-11 22:38:37,553 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:38:37,553 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:37,554 INFO  L85        PathProgramCache]: Analyzing trace with hash -1134168285, now seen corresponding path program 1 times
[2024-03-11 22:38:37,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:37,554 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272786320]
[2024-03-11 22:38:37,554 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:37,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:37,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:37,756 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-03-11 22:38:37,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:37,757 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272786320]
[2024-03-11 22:38:37,757 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272786320] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:38:37,757 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:38:37,757 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:38:37,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876894586]
[2024-03-11 22:38:37,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:38:37,758 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:38:37,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:38:37,759 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:38:37,759 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:38:37,924 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192
[2024-03-11 22:38:37,925 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 829 transitions, 10196 flow. Second operand  has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:37,925 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:38:37,925 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192
[2024-03-11 22:38:37,925 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:38:42,434 INFO  L130       PetriNetUnfolder]: 11969/21156 cut-off events.
[2024-03-11 22:38:42,435 INFO  L131       PetriNetUnfolder]: For 128620/129348 co-relation queries the response was YES.
[2024-03-11 22:38:42,501 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 130903 conditions, 21156 events. 11969/21156 cut-off events. For 128620/129348 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 155391 event pairs, 1516 based on Foata normal form. 43/20136 useless extension candidates. Maximal degree in co-relation 130856. Up to 16661 conditions per place. 
[2024-03-11 22:38:42,588 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 749 selfloop transitions, 226 changer transitions 8/1038 dead transitions.
[2024-03-11 22:38:42,588 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1038 transitions, 14627 flow
[2024-03-11 22:38:42,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:38:42,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:38:42,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 670 transitions.
[2024-03-11 22:38:42,590 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5815972222222222
[2024-03-11 22:38:42,590 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 670 transitions.
[2024-03-11 22:38:42,590 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 670 transitions.
[2024-03-11 22:38:42,591 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:38:42,591 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 670 transitions.
[2024-03-11 22:38:42,592 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:42,593 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:42,593 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:42,593 INFO  L175             Difference]: Start difference. First operand has 135 places, 829 transitions, 10196 flow. Second operand 6 states and 670 transitions.
[2024-03-11 22:38:42,594 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 1038 transitions, 14627 flow
[2024-03-11 22:38:43,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 1038 transitions, 14300 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-03-11 22:38:43,480 INFO  L231             Difference]: Finished difference. Result has 136 places, 986 transitions, 12704 flow
[2024-03-11 22:38:43,480 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=9921, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12704, PETRI_PLACES=136, PETRI_TRANSITIONS=986}
[2024-03-11 22:38:43,481 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 79 predicate places.
[2024-03-11 22:38:43,481 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 986 transitions, 12704 flow
[2024-03-11 22:38:43,481 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:43,481 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:43,481 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]
[2024-03-11 22:38:43,481 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-11 22:38:43,482 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:38:43,482 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:43,482 INFO  L85        PathProgramCache]: Analyzing trace with hash -849888369, now seen corresponding path program 1 times
[2024-03-11 22:38:43,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:43,482 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679238790]
[2024-03-11 22:38:43,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:43,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:43,498 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:43,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:43,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:43,849 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679238790]
[2024-03-11 22:38:43,849 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679238790] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:38:43,849 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071626116]
[2024-03-11 22:38:43,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:43,850 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:38:43,850 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:38:43,851 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:38:43,855 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-11 22:38:43,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:43,980 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-11 22:38:43,985 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:38:43,994 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-11 22:38:43,995 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 78 treesize of output 70
[2024-03-11 22:38:44,064 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:38:44,064 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
[2024-03-11 22:38:44,093 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
[2024-03-11 22:38:44,107 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
[2024-03-11 22:38:44,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:38:44,124 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:38:44,125 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
[2024-03-11 22:38:44,137 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:38:44,137 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
[2024-03-11 22:38:44,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 41 treesize of output 37
[2024-03-11 22:38:44,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:44,166 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:38:44,281 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_623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_623) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_623) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_623) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_623) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2024-03-11 22:38:44,300 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_623 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_623) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_623) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_623) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_623 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_623) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-11 22:38:44,414 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_614 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_614) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2024-03-11 22:38:44,415 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:38:44,415 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071626116] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:38:44,415 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:38:44,415 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 18
[2024-03-11 22:38:44,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550761105]
[2024-03-11 22:38:44,415 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:38:44,416 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-03-11 22:38:44,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:38:44,416 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-03-11 22:38:44,416 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=208, Unknown=17, NotChecked=96, Total=380
[2024-03-11 22:38:44,516 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-11 22:38:44,528 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 986 transitions, 12704 flow. Second operand  has 20 states, 20 states have (on average 59.45) internal successors, (1189), 20 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:44,529 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:38:44,529 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-11 22:38:44,529 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:38:53,642 INFO  L130       PetriNetUnfolder]: 22801/38028 cut-off events.
[2024-03-11 22:38:53,642 INFO  L131       PetriNetUnfolder]: For 263208/263212 co-relation queries the response was YES.
[2024-03-11 22:38:53,837 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 251616 conditions, 38028 events. 22801/38028 cut-off events. For 263208/263212 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 285076 event pairs, 2908 based on Foata normal form. 266/36753 useless extension candidates. Maximal degree in co-relation 224464. Up to 23308 conditions per place. 
[2024-03-11 22:38:54,119 INFO  L137   encePairwiseOnDemand]: 157/192 looper letters, 1722 selfloop transitions, 592 changer transitions 3/2319 dead transitions.
[2024-03-11 22:38:54,119 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 2319 transitions, 34320 flow
[2024-03-11 22:38:54,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-03-11 22:38:54,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-03-11 22:38:54,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1196 transitions.
[2024-03-11 22:38:54,122 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3893229166666667
[2024-03-11 22:38:54,123 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1196 transitions.
[2024-03-11 22:38:54,123 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1196 transitions.
[2024-03-11 22:38:54,123 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:38:54,123 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1196 transitions.
[2024-03-11 22:38:54,125 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 74.75) internal successors, (1196), 16 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:54,128 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 192.0) internal successors, (3264), 17 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:54,128 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 192.0) internal successors, (3264), 17 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:54,129 INFO  L175             Difference]: Start difference. First operand has 136 places, 986 transitions, 12704 flow. Second operand 16 states and 1196 transitions.
[2024-03-11 22:38:54,129 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 2319 transitions, 34320 flow
[2024-03-11 22:38:57,963 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 2319 transitions, 33510 flow, removed 405 selfloop flow, removed 0 redundant places.
[2024-03-11 22:38:57,988 INFO  L231             Difference]: Finished difference. Result has 163 places, 1662 transitions, 24510 flow
[2024-03-11 22:38:57,989 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=12294, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=24510, PETRI_PLACES=163, PETRI_TRANSITIONS=1662}
[2024-03-11 22:38:57,989 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 106 predicate places.
[2024-03-11 22:38:57,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 1662 transitions, 24510 flow
[2024-03-11 22:38:57,990 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 59.45) internal successors, (1189), 20 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:38:57,990 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:57,990 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:38:57,997 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-11 22:38:58,191 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:38:58,191 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:38:58,192 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:58,192 INFO  L85        PathProgramCache]: Analyzing trace with hash 1290046147, now seen corresponding path program 2 times
[2024-03-11 22:38:58,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:58,193 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853697250]
[2024-03-11 22:38:58,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:58,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:58,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:58,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:58,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:58,719 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853697250]
[2024-03-11 22:38:58,719 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853697250] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:38:58,719 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973950640]
[2024-03-11 22:38:58,719 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:38:58,719 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:38:58,719 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:38:58,720 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:38:58,723 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-11 22:38:58,845 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:38:58,846 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:38:58,847 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-03-11 22:38:58,853 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:38:58,863 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:58,868 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2024-03-11 22:38:59,032 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:38:59,032 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-11 22:38:59,090 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:59,091 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-11 22:38:59,134 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
[2024-03-11 22:38:59,184 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:59,185 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
[2024-03-11 22:38:59,298 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-11 22:38:59,342 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:59,343 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:59,344 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:38:59,402 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:59,404 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:59,405 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:59,406 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
[2024-03-11 22:38:59,473 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:59,474 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
[2024-03-11 22:38:59,511 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:59,512 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
[2024-03-11 22:38:59,535 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:59,536 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
[2024-03-11 22:38:59,571 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:59,573 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
[2024-03-11 22:38:59,647 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:38:59,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:38:59,704 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:38:59,733 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-11 22:38:59,776 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-11 22:38:59,844 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_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2024-03-11 22:38:59,861 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_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-11 22:38:59,881 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_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) .cse1 v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) .cse1 v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) .cse1 v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_733) .cse1 v_ArrVal_734) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-11 22:39:00,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:39:00,112 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973950640] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:39:00,112 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:39:00,112 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30
[2024-03-11 22:39:00,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312643557]
[2024-03-11 22:39:00,113 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:39:00,113 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-11 22:39:00,113 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:39:00,114 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-11 22:39:00,115 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=605, Unknown=5, NotChecked=270, Total=992
[2024-03-11 22:39:00,137 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-11 22:39:00,139 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 1662 transitions, 24510 flow. Second operand  has 32 states, 32 states have (on average 59.21875) internal successors, (1895), 32 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:39:00,139 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:39:00,139 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-11 22:39:00,140 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:39:16,917 INFO  L130       PetriNetUnfolder]: 23543/39259 cut-off events.
[2024-03-11 22:39:16,917 INFO  L131       PetriNetUnfolder]: For 398457/398457 co-relation queries the response was YES.
[2024-03-11 22:39:17,155 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 295720 conditions, 39259 events. 23543/39259 cut-off events. For 398457/398457 co-relation queries the response was YES. Maximal size of possible extension queue 1080. Compared 294797 event pairs, 1927 based on Foata normal form. 56/37774 useless extension candidates. Maximal degree in co-relation 270159. Up to 35088 conditions per place. 
[2024-03-11 22:39:17,333 INFO  L137   encePairwiseOnDemand]: 158/192 looper letters, 2153 selfloop transitions, 325 changer transitions 2/2482 dead transitions.
[2024-03-11 22:39:17,334 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 2482 transitions, 39691 flow
[2024-03-11 22:39:17,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-03-11 22:39:17,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-03-11 22:39:17,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1567 transitions.
[2024-03-11 22:39:17,338 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3709753787878788
[2024-03-11 22:39:17,338 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1567 transitions.
[2024-03-11 22:39:17,338 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1567 transitions.
[2024-03-11 22:39:17,338 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:39:17,339 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1567 transitions.
[2024-03-11 22:39:17,341 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 71.22727272727273) internal successors, (1567), 22 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:39:17,345 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 192.0) internal successors, (4416), 23 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:39:17,345 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 192.0) internal successors, (4416), 23 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:39:17,346 INFO  L175             Difference]: Start difference. First operand has 163 places, 1662 transitions, 24510 flow. Second operand 22 states and 1567 transitions.
[2024-03-11 22:39:17,346 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 2482 transitions, 39691 flow
[2024-03-11 22:39:23,532 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 2482 transitions, 39329 flow, removed 179 selfloop flow, removed 2 redundant places.
[2024-03-11 22:39:23,563 INFO  L231             Difference]: Finished difference. Result has 197 places, 1974 transitions, 30211 flow
[2024-03-11 22:39:23,564 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=24228, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=30211, PETRI_PLACES=197, PETRI_TRANSITIONS=1974}
[2024-03-11 22:39:23,565 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 140 predicate places.
[2024-03-11 22:39:23,565 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 1974 transitions, 30211 flow
[2024-03-11 22:39:23,566 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 59.21875) internal successors, (1895), 32 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:39:23,566 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:39:23,566 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]
[2024-03-11 22:39:23,572 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-11 22:39:23,766 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,SelfDestructingSolverStorable12
[2024-03-11 22:39:23,767 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:39:23,768 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:39:23,768 INFO  L85        PathProgramCache]: Analyzing trace with hash 1396978971, now seen corresponding path program 3 times
[2024-03-11 22:39:23,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:39:23,768 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211196042]
[2024-03-11 22:39:23,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:39:23,769 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:39:23,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:39:24,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:39:24,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:39:24,119 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211196042]
[2024-03-11 22:39:24,119 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211196042] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:39:24,119 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710669414]
[2024-03-11 22:39:24,119 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-11 22:39:24,119 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:39:24,120 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:39:24,121 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:39:24,121 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-11 22:39:24,265 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-11 22:39:24,266 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:39:24,268 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 60 conjunts are in the unsatisfiable core
[2024-03-11 22:39:24,275 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:39:24,287 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,292 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2024-03-11 22:39:24,527 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:39:24,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 38 treesize of output 37
[2024-03-11 22:39:24,536 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,537 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 18 treesize of output 20
[2024-03-11 22:39:24,608 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,609 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-11 22:39:24,618 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,619 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-11 22:39:24,715 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-11 22:39:24,720 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-03-11 22:39:24,784 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
[2024-03-11 22:39:24,825 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,826 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
[2024-03-11 22:39:24,867 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,868 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,869 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:39:24,918 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,919 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,920 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,921 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
[2024-03-11 22:39:24,979 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,980 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,981 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:39:24,981 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2024-03-11 22:39:25,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:39:25,015 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:39:26,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:39:26,844 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710669414] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:39:26,844 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:39:26,844 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 33
[2024-03-11 22:39:26,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939808034]
[2024-03-11 22:39:26,845 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:39:26,845 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-03-11 22:39:26,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:39:26,846 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-03-11 22:39:26,847 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1002, Unknown=11, NotChecked=0, Total=1190
[2024-03-11 22:39:30,117 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 47 out of 192
[2024-03-11 22:39:30,120 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 1974 transitions, 30211 flow. Second operand  has 35 states, 35 states have (on average 49.114285714285714) internal successors, (1719), 35 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:39:30,120 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:39:30,120 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 192
[2024-03-11 22:39:30,120 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:39:59,051 INFO  L130       PetriNetUnfolder]: 37465/62021 cut-off events.
[2024-03-11 22:39:59,051 INFO  L131       PetriNetUnfolder]: For 765941/765953 co-relation queries the response was YES.
[2024-03-11 22:39:59,603 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 495507 conditions, 62021 events. 37465/62021 cut-off events. For 765941/765953 co-relation queries the response was YES. Maximal size of possible extension queue 1752. Compared 496190 event pairs, 3186 based on Foata normal form. 338/59948 useless extension candidates. Maximal degree in co-relation 492583. Up to 34229 conditions per place. 
[2024-03-11 22:39:59,898 INFO  L137   encePairwiseOnDemand]: 165/192 looper letters, 4057 selfloop transitions, 1097 changer transitions 16/5172 dead transitions.
[2024-03-11 22:39:59,898 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 5172 transitions, 86280 flow
[2024-03-11 22:39:59,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-03-11 22:39:59,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-03-11 22:39:59,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2222 transitions.
[2024-03-11 22:39:59,902 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3306547619047619
[2024-03-11 22:39:59,903 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 2222 transitions.
[2024-03-11 22:39:59,903 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 2222 transitions.
[2024-03-11 22:39:59,903 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:39:59,904 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2222 transitions.
[2024-03-11 22:39:59,907 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 63.48571428571429) internal successors, (2222), 35 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:39:59,912 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 192.0) internal successors, (6912), 36 states have internal predecessors, (6912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:39:59,912 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 192.0) internal successors, (6912), 36 states have internal predecessors, (6912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:39:59,913 INFO  L175             Difference]: Start difference. First operand has 197 places, 1974 transitions, 30211 flow. Second operand 35 states and 2222 transitions.
[2024-03-11 22:39:59,913 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 5172 transitions, 86280 flow
[2024-03-11 22:40:25,059 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 5172 transitions, 85421 flow, removed 417 selfloop flow, removed 7 redundant places.
[2024-03-11 22:40:25,115 INFO  L231             Difference]: Finished difference. Result has 252 places, 3089 transitions, 52928 flow
[2024-03-11 22:40:25,116 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=29786, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1974, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=52928, PETRI_PLACES=252, PETRI_TRANSITIONS=3089}
[2024-03-11 22:40:25,116 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 195 predicate places.
[2024-03-11 22:40:25,116 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 3089 transitions, 52928 flow
[2024-03-11 22:40:25,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 49.114285714285714) internal successors, (1719), 35 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:25,117 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:40:25,117 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]
[2024-03-11 22:40:25,125 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
[2024-03-11 22:40:25,318 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,SelfDestructingSolverStorable13
[2024-03-11 22:40:25,318 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:40:25,319 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:40:25,319 INFO  L85        PathProgramCache]: Analyzing trace with hash 1276488765, now seen corresponding path program 4 times
[2024-03-11 22:40:25,320 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:40:25,320 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435761279]
[2024-03-11 22:40:25,320 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:40:25,320 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:40:25,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:40:25,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:25,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:40:25,773 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435761279]
[2024-03-11 22:40:25,774 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435761279] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:40:25,774 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24225855]
[2024-03-11 22:40:25,774 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-11 22:40:25,774 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:40:25,774 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:40:25,775 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:40:25,777 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-11 22:40:25,984 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-11 22:40:25,984 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:40:25,986 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-03-11 22:40:25,990 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:40:26,001 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:40:26,007 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-11 22:40:26,007 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 44 treesize of output 36
[2024-03-11 22:40:26,127 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:40:26,127 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
[2024-03-11 22:40:26,160 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:40:26,161 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
[2024-03-11 22:40:26,200 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
[2024-03-11 22:40:26,238 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:40:26,310 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:26,310 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
[2024-03-11 22:40:26,369 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
[2024-03-11 22:40:26,422 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:40:26,423 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 32 treesize of output 30
[2024-03-11 22:40:26,444 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:26,444 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
[2024-03-11 22:40:26,515 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:40:26,516 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
[2024-03-11 22:40:26,543 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:40:26,544 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
[2024-03-11 22:40:26,561 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:40:26,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
[2024-03-11 22:40:26,598 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:40:26,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:26,609 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:40:26,635 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_956 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_956 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_956 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_956 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:40:26,671 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2024-03-11 22:40:26,885 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-03-11 22:40:26,932 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse2 v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse2 v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse2 v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse2 v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false
[2024-03-11 22:40:27,205 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse3 v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse3 v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) .cse6))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select .cse7 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse3 v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_950))) (store .cse8 c_threadThread1of2ForFork0_~t~0.base (store (select .cse8 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse3 v_ArrVal_956) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-11 22:40:27,226 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:27,226 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 3 case distinctions, treesize of input 71 treesize of output 64
[2024-03-11 22:40:27,239 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:40:27,239 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 294 treesize of output 218
[2024-03-11 22:40:27,245 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 182
[2024-03-11 22:40:27,247 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 158
[2024-03-11 22:40:27,282 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-11 22:40:27,282 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 1
[2024-03-11 22:40:27,288 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-11 22:40:27,289 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 1
[2024-03-11 22:40:27,294 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-11 22:40:27,294 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 1
[2024-03-11 22:40:27,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:40:27,394 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [24225855] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:40:27,395 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:40:27,395 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 30
[2024-03-11 22:40:27,395 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315178609]
[2024-03-11 22:40:27,395 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:40:27,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-11 22:40:27,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:40:27,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-11 22:40:27,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=572, Unknown=33, NotChecked=270, Total=992
[2024-03-11 22:40:27,577 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-11 22:40:27,579 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 3089 transitions, 52928 flow. Second operand  has 32 states, 32 states have (on average 59.15625) internal successors, (1893), 32 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:40:27,579 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:40:27,579 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-11 22:40:27,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:41:06,085 INFO  L130       PetriNetUnfolder]: 37572/62180 cut-off events.
[2024-03-11 22:41:06,085 INFO  L131       PetriNetUnfolder]: For 1255253/1255265 co-relation queries the response was YES.
[2024-03-11 22:41:06,822 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 569131 conditions, 62180 events. 37572/62180 cut-off events. For 1255253/1255265 co-relation queries the response was YES. Maximal size of possible extension queue 1747. Compared 497445 event pairs, 3315 based on Foata normal form. 108/59877 useless extension candidates. Maximal degree in co-relation 558370. Up to 55694 conditions per place. 
[2024-03-11 22:41:07,163 INFO  L137   encePairwiseOnDemand]: 163/192 looper letters, 3133 selfloop transitions, 521 changer transitions 0/3656 dead transitions.
[2024-03-11 22:41:07,163 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 3656 transitions, 69569 flow
[2024-03-11 22:41:07,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-03-11 22:41:07,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-03-11 22:41:07,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1701 transitions.
[2024-03-11 22:41:07,166 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.369140625
[2024-03-11 22:41:07,166 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1701 transitions.
[2024-03-11 22:41:07,166 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1701 transitions.
[2024-03-11 22:41:07,166 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:41:07,166 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1701 transitions.
[2024-03-11 22:41:07,168 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 70.875) internal successors, (1701), 24 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:07,171 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:07,172 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:07,172 INFO  L175             Difference]: Start difference. First operand has 252 places, 3089 transitions, 52928 flow. Second operand 24 states and 1701 transitions.
[2024-03-11 22:41:07,172 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 3656 transitions, 69569 flow
[2024-03-11 22:41:44,030 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 3656 transitions, 66896 flow, removed 1314 selfloop flow, removed 5 redundant places.
[2024-03-11 22:41:44,085 INFO  L231             Difference]: Finished difference. Result has 280 places, 3269 transitions, 55531 flow
[2024-03-11 22:41:44,086 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=50165, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3080, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=351, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=55531, PETRI_PLACES=280, PETRI_TRANSITIONS=3269}
[2024-03-11 22:41:44,087 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 223 predicate places.
[2024-03-11 22:41:44,087 INFO  L495      AbstractCegarLoop]: Abstraction has has 280 places, 3269 transitions, 55531 flow
[2024-03-11 22:41:44,087 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 59.15625) internal successors, (1893), 32 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:44,087 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:41:44,087 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]
[2024-03-11 22:41:44,095 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-11 22:41:44,288 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,SelfDestructingSolverStorable14
[2024-03-11 22:41:44,289 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:41:44,290 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:41:44,291 INFO  L85        PathProgramCache]: Analyzing trace with hash -1257854249, now seen corresponding path program 5 times
[2024-03-11 22:41:44,291 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:41:44,291 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997750186]
[2024-03-11 22:41:44,292 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:41:44,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:41:44,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:41:44,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:44,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:41:44,722 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997750186]
[2024-03-11 22:41:44,722 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997750186] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:41:44,722 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826409245]
[2024-03-11 22:41:44,722 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-11 22:41:44,722 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:41:44,723 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:41:44,724 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:41:44,732 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-11 22:41:44,858 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:41:44,858 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:41:44,859 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 52 conjunts are in the unsatisfiable core
[2024-03-11 22:41:44,862 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:41:44,878 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2024-03-11 22:41:45,032 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:41:45,033 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-11 22:41:45,088 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-11 22:41:45,126 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
[2024-03-11 22:41:45,212 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-11 22:41:45,243 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:41:45,244 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
[2024-03-11 22:41:45,281 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:41:45,284 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:41:45,286 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
[2024-03-11 22:41:45,343 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:41:45,346 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:41:45,347 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:41:45,349 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:41:45,414 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
[2024-03-11 22:41:45,498 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
[2024-03-11 22:41:45,534 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
[2024-03-11 22:41:45,579 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
[2024-03-11 22:41:45,642 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:41:45,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:45,669 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:41:45,685 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1068 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1068 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1068 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1068 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-11 22:41:45,714 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-11 22:41:46,143 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.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 (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1067 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1068) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-11 22:41:46,375 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:41:46,376 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2024-03-11 22:41:46,381 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:41:46,381 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 248 treesize of output 154
[2024-03-11 22:41:46,385 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110
[2024-03-11 22:41:46,388 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51
[2024-03-11 22:41:46,407 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:41:46,407 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-11 22:41:46,412 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:41:46,412 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2024-03-11 22:41:46,417 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:41:46,417 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-11 22:41:46,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:41:46,515 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [826409245] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:41:46,515 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:41:46,515 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31
[2024-03-11 22:41:46,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976100704]
[2024-03-11 22:41:46,515 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:41:46,516 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2024-03-11 22:41:46,516 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:41:46,516 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2024-03-11 22:41:46,517 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=711, Unknown=42, NotChecked=174, Total=1056
[2024-03-11 22:41:46,643 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-11 22:41:46,644 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 3269 transitions, 55531 flow. Second operand  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:41:46,644 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:41:46,644 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-11 22:41:46,644 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:42:29,469 INFO  L130       PetriNetUnfolder]: 38984/64426 cut-off events.
[2024-03-11 22:42:29,470 INFO  L131       PetriNetUnfolder]: For 1359644/1359644 co-relation queries the response was YES.
[2024-03-11 22:42:30,341 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 597546 conditions, 64426 events. 38984/64426 cut-off events. For 1359644/1359644 co-relation queries the response was YES. Maximal size of possible extension queue 1807. Compared 516797 event pairs, 3506 based on Foata normal form. 112/62127 useless extension candidates. Maximal degree in co-relation 587887. Up to 56786 conditions per place. 
[2024-03-11 22:42:30,676 INFO  L137   encePairwiseOnDemand]: 169/192 looper letters, 3522 selfloop transitions, 556 changer transitions 0/4080 dead transitions.
[2024-03-11 22:42:30,676 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 4080 transitions, 78721 flow
[2024-03-11 22:42:30,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-11 22:42:30,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-11 22:42:30,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1486 transitions.
[2024-03-11 22:42:30,679 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3685515873015873
[2024-03-11 22:42:30,679 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1486 transitions.
[2024-03-11 22:42:30,679 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1486 transitions.
[2024-03-11 22:42:30,680 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:42:30,680 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1486 transitions.
[2024-03-11 22:42:30,681 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 70.76190476190476) internal successors, (1486), 21 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:42:30,684 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:42:30,684 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:42:30,684 INFO  L175             Difference]: Start difference. First operand has 280 places, 3269 transitions, 55531 flow. Second operand 21 states and 1486 transitions.
[2024-03-11 22:42:30,684 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 4080 transitions, 78721 flow
[2024-03-11 22:43:07,041 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 4080 transitions, 77711 flow, removed 490 selfloop flow, removed 5 redundant places.
[2024-03-11 22:43:07,103 INFO  L231             Difference]: Finished difference. Result has 306 places, 3595 transitions, 64034 flow
[2024-03-11 22:43:07,105 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=54761, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2821, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=64034, PETRI_PLACES=306, PETRI_TRANSITIONS=3595}
[2024-03-11 22:43:07,105 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 249 predicate places.
[2024-03-11 22:43:07,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 3595 transitions, 64034 flow
[2024-03-11 22:43:07,106 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:43:07,106 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:43:07,106 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]
[2024-03-11 22:43:07,110 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-11 22:43:07,309 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,SelfDestructingSolverStorable15
[2024-03-11 22:43:07,310 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:43:07,311 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:43:07,311 INFO  L85        PathProgramCache]: Analyzing trace with hash 297319731, now seen corresponding path program 6 times
[2024-03-11 22:43:07,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:43:07,312 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342460176]
[2024-03-11 22:43:07,312 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:43:07,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:43:07,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:43:07,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:43:07,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:43:07,721 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342460176]
[2024-03-11 22:43:07,722 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342460176] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:43:07,722 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238156877]
[2024-03-11 22:43:07,722 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-11 22:43:07,722 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:43:07,722 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:43:07,724 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)
[2024-03-11 22:43:07,725 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
[2024-03-11 22:43:07,890 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-11 22:43:07,890 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:43:07,892 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-03-11 22:43:07,897 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:43:07,908 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:07,911 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2024-03-11 22:43:08,087 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:43:08,088 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-11 22:43:08,141 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:08,142 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-11 22:43:08,215 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
[2024-03-11 22:43:08,268 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-11 22:43:08,313 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:08,314 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-11 22:43:08,329 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:08,329 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-11 22:43:08,342 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:08,342 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-11 22:43:08,363 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:08,364 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-11 22:43:08,399 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:08,399 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
[2024-03-11 22:43:08,446 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:08,447 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:08,447 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:43:08,490 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:08,491 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:08,492 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:43:08,492 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
[2024-03-11 22:43:08,556 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:43:08,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:43:08,590 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:43:08,629 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1179 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1179) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1179 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1179) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1179 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1179) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1179 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1179) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-03-11 22:43:08,980 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) (+ c_threadThread1of2ForFork0_~t~0.offset 3) |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1179 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1179) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1179 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1179) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1179 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1179) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-11 22:43:09,251 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:43:09,252 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 1 case distinctions, treesize of input 56 treesize of output 49
[2024-03-11 22:43:09,263 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 72 treesize of output 60
[2024-03-11 22:43:09,266 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48
[2024-03-11 22:43:09,270 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28
[2024-03-11 22:43:09,404 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:43:09,405 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [238156877] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:43:09,405 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:43:09,405 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31
[2024-03-11 22:43:09,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312163883]
[2024-03-11 22:43:09,405 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:43:09,406 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2024-03-11 22:43:09,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:43:09,406 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2024-03-11 22:43:09,407 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=765, Unknown=45, NotChecked=118, Total=1056
[2024-03-11 22:43:09,542 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-11 22:43:09,544 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 3595 transitions, 64034 flow. Second operand  has 33 states, 33 states have (on average 59.121212121212125) internal successors, (1951), 33 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:43:09,544 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:43:09,544 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-11 22:43:09,544 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:43:56,790 INFO  L130       PetriNetUnfolder]: 39410/65084 cut-off events.
[2024-03-11 22:43:56,790 INFO  L131       PetriNetUnfolder]: For 1526206/1526218 co-relation queries the response was YES.
[2024-03-11 22:43:57,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 625089 conditions, 65084 events. 39410/65084 cut-off events. For 1526206/1526218 co-relation queries the response was YES. Maximal size of possible extension queue 1827. Compared 522001 event pairs, 3474 based on Foata normal form. 124/62797 useless extension candidates. Maximal degree in co-relation 622227. Up to 56163 conditions per place. 
[2024-03-11 22:43:58,115 INFO  L137   encePairwiseOnDemand]: 167/192 looper letters, 3446 selfloop transitions, 805 changer transitions 0/4253 dead transitions.
[2024-03-11 22:43:58,116 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 4253 transitions, 84945 flow
[2024-03-11 22:43:58,117 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-11 22:43:58,117 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-11 22:43:58,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1377 transitions.
[2024-03-11 22:43:58,118 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3774671052631579
[2024-03-11 22:43:58,118 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1377 transitions.
[2024-03-11 22:43:58,118 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1377 transitions.
[2024-03-11 22:43:58,118 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:43:58,119 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1377 transitions.
[2024-03-11 22:43:58,120 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 72.47368421052632) internal successors, (1377), 19 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:43:58,122 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:43:58,123 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:43:58,123 INFO  L175             Difference]: Start difference. First operand has 306 places, 3595 transitions, 64034 flow. Second operand 19 states and 1377 transitions.
[2024-03-11 22:43:58,123 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 4253 transitions, 84945 flow
[2024-03-11 22:44:46,058 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 4253 transitions, 83759 flow, removed 558 selfloop flow, removed 7 redundant places.
[2024-03-11 22:44:46,124 INFO  L231             Difference]: Finished difference. Result has 326 places, 3789 transitions, 70365 flow
[2024-03-11 22:44:46,126 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=62928, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=631, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=70365, PETRI_PLACES=326, PETRI_TRANSITIONS=3789}
[2024-03-11 22:44:46,126 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 269 predicate places.
[2024-03-11 22:44:46,127 INFO  L495      AbstractCegarLoop]: Abstraction has has 326 places, 3789 transitions, 70365 flow
[2024-03-11 22:44:46,127 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 59.121212121212125) internal successors, (1951), 33 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:44:46,127 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:44:46,127 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]
[2024-03-11 22:44:46,133 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-11 22:44:46,328 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-11 22:44:46,328 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:44:46,329 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:44:46,329 INFO  L85        PathProgramCache]: Analyzing trace with hash -697864417, now seen corresponding path program 1 times
[2024-03-11 22:44:46,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:44:46,330 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235513935]
[2024-03-11 22:44:46,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:44:46,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:44:46,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:44:46,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:44:46,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:44:46,674 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235513935]
[2024-03-11 22:44:46,674 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235513935] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:44:46,674 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719335101]
[2024-03-11 22:44:46,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:44:46,675 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:44:46,675 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:44:46,676 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:44:46,678 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-11 22:44:46,822 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:44:46,823 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-11 22:44:46,826 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:44:46,845 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2024-03-11 22:44:46,961 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:44:46,961 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-11 22:44:47,000 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-11 22:44:47,048 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-11 22:44:47,065 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:44:47,072 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 18 treesize of output 20
[2024-03-11 22:44:47,079 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:44:47,098 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:44:47,098 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:44:47,112 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:44:47,112 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:44:47,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:44:47,122 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:44:47,146 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1281) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) 0)) is different from false
[2024-03-11 22:44:47,152 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:44:47,152 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 1 case distinctions, treesize of input 26 treesize of output 27
[2024-03-11 22:44:47,155 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 42 treesize of output 26
[2024-03-11 22:44:47,222 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (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_1278) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-11 22:44:47,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:44:47,340 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719335101] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:44:47,340 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:44:47,340 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 21
[2024-03-11 22:44:47,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504386894]
[2024-03-11 22:44:47,340 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:44:47,340 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2024-03-11 22:44:47,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:44:47,341 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-03-11 22:44:47,341 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=351, Unknown=6, NotChecked=78, Total=506
[2024-03-11 22:44:47,630 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 192
[2024-03-11 22:44:47,631 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 3789 transitions, 70365 flow. Second operand  has 23 states, 23 states have (on average 56.30434782608695) internal successors, (1295), 23 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:44:47,631 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:44:47,631 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 192
[2024-03-11 22:44:47,632 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:45:39,983 INFO  L130       PetriNetUnfolder]: 40332/66604 cut-off events.
[2024-03-11 22:45:39,984 INFO  L131       PetriNetUnfolder]: For 1698990/1699002 co-relation queries the response was YES.
[2024-03-11 22:45:41,184 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 657826 conditions, 66604 events. 40332/66604 cut-off events. For 1698990/1699002 co-relation queries the response was YES. Maximal size of possible extension queue 1859. Compared 536451 event pairs, 2672 based on Foata normal form. 331/64408 useless extension candidates. Maximal degree in co-relation 654695. Up to 30288 conditions per place. 
[2024-03-11 22:45:41,717 INFO  L137   encePairwiseOnDemand]: 169/192 looper letters, 3129 selfloop transitions, 2303 changer transitions 0/5434 dead transitions.
[2024-03-11 22:45:41,717 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 5434 transitions, 112042 flow
[2024-03-11 22:45:41,718 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-03-11 22:45:41,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-03-11 22:45:41,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2038 transitions.
[2024-03-11 22:45:41,722 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3424059139784946
[2024-03-11 22:45:41,722 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2038 transitions.
[2024-03-11 22:45:41,722 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2038 transitions.
[2024-03-11 22:45:41,722 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:45:41,722 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2038 transitions.
[2024-03-11 22:45:41,724 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 65.74193548387096) internal successors, (2038), 31 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:45:41,729 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 192.0) internal successors, (6144), 32 states have internal predecessors, (6144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:45:41,729 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 192.0) internal successors, (6144), 32 states have internal predecessors, (6144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:45:41,729 INFO  L175             Difference]: Start difference. First operand has 326 places, 3789 transitions, 70365 flow. Second operand 31 states and 2038 transitions.
[2024-03-11 22:45:41,729 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 5434 transitions, 112042 flow
[2024-03-11 22:46:37,677 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 5434 transitions, 110653 flow, removed 662 selfloop flow, removed 6 redundant places.
[2024-03-11 22:46:37,764 INFO  L231             Difference]: Finished difference. Result has 365 places, 4602 transitions, 95015 flow
[2024-03-11 22:46:37,766 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=69196, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1579, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=95015, PETRI_PLACES=365, PETRI_TRANSITIONS=4602}
[2024-03-11 22:46:37,767 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 308 predicate places.
[2024-03-11 22:46:37,767 INFO  L495      AbstractCegarLoop]: Abstraction has has 365 places, 4602 transitions, 95015 flow
[2024-03-11 22:46:37,767 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 56.30434782608695) internal successors, (1295), 23 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:46:37,767 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:46:37,767 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]
[2024-03-11 22:46:37,772 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-03-11 22:46:37,968 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-03-11 22:46:37,968 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:46:37,969 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:46:37,969 INFO  L85        PathProgramCache]: Analyzing trace with hash 922624721, now seen corresponding path program 7 times
[2024-03-11 22:46:37,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:46:37,970 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423065053]
[2024-03-11 22:46:37,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:46:37,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:46:37,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:46:38,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:46:38,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:46:38,373 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423065053]
[2024-03-11 22:46:38,373 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423065053] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:46:38,373 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418877921]
[2024-03-11 22:46:38,373 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-03-11 22:46:38,373 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:46:38,373 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:46:38,374 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:46:38,376 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-03-11 22:46:38,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:46:38,525 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 55 conjunts are in the unsatisfiable core
[2024-03-11 22:46:38,537 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:46:38,548 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2024-03-11 22:46:38,696 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:46:38,697 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 38 treesize of output 37
[2024-03-11 22:46:38,701 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:46:38,702 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 18 treesize of output 20
[2024-03-11 22:46:38,837 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-11 22:46:38,848 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 15 treesize of output 7
[2024-03-11 22:46:38,947 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
[2024-03-11 22:46:38,983 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:46:38,984 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
[2024-03-11 22:46:39,038 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:46:39,039 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:46:39,040 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
[2024-03-11 22:46:39,110 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:46:39,111 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:46:39,112 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:46:39,113 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:46:39,171 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
[2024-03-11 22:46:39,250 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:46:39,251 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:46:39,251 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:46:39,252 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2024-03-11 22:46:39,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:46:39,285 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:46:39,419 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1395 Int) (v_ArrVal_1394 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1394))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_1395))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1395 Int) (v_ArrVal_1394 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1394))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_1395))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1395 Int) (v_ArrVal_1394 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1394))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_1395))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1395 Int) (v_ArrVal_1394 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1394))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 v_ArrVal_1395))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))))) is different from false
[2024-03-11 22:46:40,346 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:46:40,346 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 73 treesize of output 66
[2024-03-11 22:46:40,362 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:46:40,362 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 340 treesize of output 298
[2024-03-11 22:46:40,373 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 300 treesize of output 280
[2024-03-11 22:46:40,393 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 226
[2024-03-11 22:46:40,554 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:46:40,554 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 59
[2024-03-11 22:46:40,581 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:46:40,582 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 66
[2024-03-11 22:46:40,586 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:46:40,614 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:46:40,614 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 126
[2024-03-11 22:46:40,621 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61
[2024-03-11 22:46:40,627 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 104
[2024-03-11 22:46:40,664 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:46:40,664 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 64
[2024-03-11 22:46:40,669 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:46:40,679 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:46:40,679 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 118
[2024-03-11 22:46:40,688 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55
[2024-03-11 22:46:40,696 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 96
[2024-03-11 22:46:40,734 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:46:40,734 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 66
[2024-03-11 22:46:40,740 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:46:40,749 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:46:40,750 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 114
[2024-03-11 22:46:40,759 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55
[2024-03-11 22:46:40,772 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 104
[2024-03-11 22:46:41,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:46:41,676 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [418877921] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:46:41,676 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:46:41,676 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 36
[2024-03-11 22:46:41,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53171568]
[2024-03-11 22:46:41,677 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:46:41,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 38 states
[2024-03-11 22:46:41,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:46:41,678 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2024-03-11 22:46:41,678 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1129, Unknown=22, NotChecked=70, Total=1406
[2024-03-11 22:46:42,312 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 192
[2024-03-11 22:46:42,313 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 4602 transitions, 95015 flow. Second operand  has 38 states, 38 states have (on average 53.94736842105263) internal successors, (2050), 38 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:46:42,314 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:46:42,314 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 192
[2024-03-11 22:46:42,314 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:47:49,324 INFO  L130       PetriNetUnfolder]: 40860/67455 cut-off events.
[2024-03-11 22:47:49,324 INFO  L131       PetriNetUnfolder]: For 1865649/1865661 co-relation queries the response was YES.
[2024-03-11 22:47:50,707 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 695694 conditions, 67455 events. 40860/67455 cut-off events. For 1865649/1865661 co-relation queries the response was YES. Maximal size of possible extension queue 1879. Compared 543975 event pairs, 3340 based on Foata normal form. 167/65042 useless extension candidates. Maximal degree in co-relation 692702. Up to 24746 conditions per place. 
[2024-03-11 22:47:51,080 INFO  L137   encePairwiseOnDemand]: 159/192 looper letters, 4701 selfloop transitions, 1422 changer transitions 9/6134 dead transitions.
[2024-03-11 22:47:51,080 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 6134 transitions, 133988 flow
[2024-03-11 22:47:51,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-03-11 22:47:51,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2024-03-11 22:47:51,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1586 transitions.
[2024-03-11 22:47:51,082 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3591485507246377
[2024-03-11 22:47:51,083 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1586 transitions.
[2024-03-11 22:47:51,083 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1586 transitions.
[2024-03-11 22:47:51,083 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:47:51,083 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1586 transitions.
[2024-03-11 22:47:51,085 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 68.95652173913044) internal successors, (1586), 23 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:47:51,088 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:47:51,088 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:47:51,088 INFO  L175             Difference]: Start difference. First operand has 365 places, 4602 transitions, 95015 flow. Second operand 23 states and 1586 transitions.
[2024-03-11 22:47:51,088 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 6134 transitions, 133988 flow
[2024-03-11 22:49:11,035 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 6134 transitions, 130497 flow, removed 1715 selfloop flow, removed 5 redundant places.
[2024-03-11 22:49:11,131 INFO  L231             Difference]: Finished difference. Result has 394 places, 4989 transitions, 104491 flow
[2024-03-11 22:49:11,134 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=92338, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1071, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=104491, PETRI_PLACES=394, PETRI_TRANSITIONS=4989}
[2024-03-11 22:49:11,134 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 337 predicate places.
[2024-03-11 22:49:11,134 INFO  L495      AbstractCegarLoop]: Abstraction has has 394 places, 4989 transitions, 104491 flow
[2024-03-11 22:49:11,134 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 38 states, 38 states have (on average 53.94736842105263) internal successors, (2050), 38 states have internal predecessors, (2050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:49:11,135 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:49:11,135 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]
[2024-03-11 22:49:11,142 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-03-11 22:49:11,336 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:49:11,336 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-11 22:49:11,337 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:49:11,337 INFO  L85        PathProgramCache]: Analyzing trace with hash -2102890091, now seen corresponding path program 1 times
[2024-03-11 22:49:11,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:49:11,337 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239321025]
[2024-03-11 22:49:11,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:49:11,338 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:49:11,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:49:11,716 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:49:11,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:49:11,717 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239321025]
[2024-03-11 22:49:11,717 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239321025] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:49:11,717 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326265627]
[2024-03-11 22:49:11,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:49:11,717 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:49:11,717 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:49:11,718 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:49:11,720 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-03-11 22:49:11,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:49:11,897 INFO  L263         TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-11 22:49:11,901 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:49:11,915 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-11 22:49:11,916 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 140 treesize of output 130
[2024-03-11 22:49:11,996 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-11 22:49:11,997 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
[2024-03-11 22:49:12,030 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
[2024-03-11 22:49:12,048 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:49:12,053 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:49:12,072 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:49:12,072 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:49:12,088 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:49:12,088 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:49:12,102 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2024-03-11 22:49:12,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:49:12,111 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:49:12,136 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1507) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1507 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1507) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse0)))) (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1507) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1507) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)))) is different from false
[2024-03-11 22:49:12,255 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse3)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse3))) (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|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1507) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1) 0)) (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1507) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)) (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1507) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1507 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1507) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse3)) 0)))))) is different from false
[2024-03-11 22:49:12,368 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1498 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1498) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-11 22:49:12,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:49:12,369 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326265627] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:49:12,369 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:49:12,370 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 18
[2024-03-11 22:49:12,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456363089]
[2024-03-11 22:49:12,370 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:49:12,370 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-03-11 22:49:12,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:49:12,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-03-11 22:49:12,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=215, Unknown=9, NotChecked=96, Total=380
[2024-03-11 22:49:12,473 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 192
[2024-03-11 22:49:12,474 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 4989 transitions, 104491 flow. Second operand  has 20 states, 20 states have (on average 56.45) internal successors, (1129), 20 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:49:12,474 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:49:12,474 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 192
[2024-03-11 22:49:12,474 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:50:24,775 INFO  L130       PetriNetUnfolder]: 42950/71027 cut-off events.
[2024-03-11 22:50:24,776 INFO  L131       PetriNetUnfolder]: For 2113307/2113319 co-relation queries the response was YES.
[2024-03-11 22:50:26,298 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 756601 conditions, 71027 events. 42950/71027 cut-off events. For 2113307/2113319 co-relation queries the response was YES. Maximal size of possible extension queue 1984. Compared 580518 event pairs, 3764 based on Foata normal form. 284/68571 useless extension candidates. Maximal degree in co-relation 753219. Up to 49521 conditions per place. 
[2024-03-11 22:50:26,713 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 5249 selfloop transitions, 1761 changer transitions 1/7013 dead transitions.
[2024-03-11 22:50:26,714 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 7013 transitions, 158875 flow
[2024-03-11 22:50:26,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2024-03-11 22:50:26,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2024-03-11 22:50:26,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1177 transitions.
[2024-03-11 22:50:26,725 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3606004901960784
[2024-03-11 22:50:26,725 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1177 transitions.
[2024-03-11 22:50:26,725 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1177 transitions.
[2024-03-11 22:50:26,725 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:50:26,726 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1177 transitions.
[2024-03-11 22:50:26,728 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 69.23529411764706) internal successors, (1177), 17 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:50:26,732 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 192.0) internal successors, (3456), 18 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:50:26,732 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 192.0) internal successors, (3456), 18 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:50:26,732 INFO  L175             Difference]: Start difference. First operand has 394 places, 4989 transitions, 104491 flow. Second operand 17 states and 1177 transitions.
[2024-03-11 22:50:26,733 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 7013 transitions, 158875 flow
Killed by 15
