./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-in-array-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-in-array-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 06b8293bfc8fa7c18cca7c4b94c4d9314b1147e783089fd7489d3ed89d7a84d1
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 22:25:00,415 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 22:25:00,417 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 22:25:00,437 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 22:25:00,438 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 22:25:00,439 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 22:25:00,440 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 22:25:00,441 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 22:25:00,442 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 22:25:00,443 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 22:25:00,443 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 22:25:00,444 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 22:25:00,445 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 22:25:00,446 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 22:25:00,446 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 22:25:00,447 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 22:25:00,448 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 22:25:00,449 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 22:25:00,450 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 22:25:00,452 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 22:25:00,453 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 22:25:00,454 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 22:25:00,455 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 22:25:00,455 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 22:25:00,458 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 22:25:00,458 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 22:25:00,459 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 22:25:00,459 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 22:25:00,460 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 22:25:00,461 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 22:25:00,461 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 22:25:00,462 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 22:25:00,462 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 22:25:00,463 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 22:25:00,464 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 22:25:00,464 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 22:25:00,464 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 22:25:00,465 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 22:25:00,465 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 22:25:00,466 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 22:25:00,466 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 22:25:00,467 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:25:00,483 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 22:25:00,483 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 22:25:00,484 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 22:25:00,484 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 22:25:00,484 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 22:25:00,485 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 22:25:00,485 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 22:25:00,485 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 22:25:00,485 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 22:25:00,486 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 22:25:00,486 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 22:25:00,486 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 22:25:00,486 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 22:25:00,486 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 22:25:00,487 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 22:25:00,487 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 22:25:00,487 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 22:25:00,487 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 22:25:00,487 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 22:25:00,487 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 22:25:00,488 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 22:25:00,488 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 22:25:00,488 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 22:25:00,488 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 22:25:00,489 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 22:25:00,489 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 22:25:00,489 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:25:00,489 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 22:25:00,489 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 22:25:00,490 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 22:25:00,490 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 22:25:00,490 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 22:25:00,490 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 22:25:00,490 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 22:25:00,490 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 22:25:00,491 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 22:25:00,491 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 22:25:00,491 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 -> 06b8293bfc8fa7c18cca7c4b94c4d9314b1147e783089fd7489d3ed89d7a84d1
[2024-03-11 22:25:00,661 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 22:25:00,684 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 22:25:00,686 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 22:25:00,687 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 22:25:00,689 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 22:25:00,690 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array-race.i
[2024-03-11 22:25:01,803 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 22:25:02,007 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 22:25:02,008 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array-race.i
[2024-03-11 22:25:02,019 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/7cc1014cb/de65d0f54555437296dbe2a6ab361b76/FLAG5ada0ac9c
[2024-03-11 22:25:02,357 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/7cc1014cb/de65d0f54555437296dbe2a6ab361b76
[2024-03-11 22:25:02,360 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 22:25:02,361 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 22:25:02,362 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 22:25:02,362 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 22:25:02,365 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 22:25:02,366 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:25:02" (1/1) ...
[2024-03-11 22:25:02,366 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d5f264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02, skipping insertion in model container
[2024-03-11 22:25:02,367 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:25:02" (1/1) ...
[2024-03-11 22:25:02,372 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 22:25:02,410 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 22:25:02,536 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:25:02,667 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:25:02,673 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 22:25:02,684 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:25:02,709 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:25:02,745 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 22:25:02,746 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02 WrapperNode
[2024-03-11 22:25:02,746 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 22:25:02,747 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 22:25:02,747 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 22:25:02,747 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 22:25:02,752 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:25:02" (1/1) ...
[2024-03-11 22:25:02,772 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:25:02" (1/1) ...
[2024-03-11 22:25:02,794 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2024-03-11 22:25:02,794 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 22:25:02,795 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 22:25:02,795 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 22:25:02,795 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 22:25:02,803 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02" (1/1) ...
[2024-03-11 22:25:02,803 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02" (1/1) ...
[2024-03-11 22:25:02,807 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02" (1/1) ...
[2024-03-11 22:25:02,807 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02" (1/1) ...
[2024-03-11 22:25:02,817 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02" (1/1) ...
[2024-03-11 22:25:02,820 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02" (1/1) ...
[2024-03-11 22:25:02,822 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02" (1/1) ...
[2024-03-11 22:25:02,823 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02" (1/1) ...
[2024-03-11 22:25:02,825 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 22:25:02,826 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 22:25:02,826 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 22:25:02,826 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 22:25:02,827 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02" (1/1) ...
[2024-03-11 22:25:02,832 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:25:02,841 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:02,852 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:25:02,854 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:25:02,880 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 22:25:02,880 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 22:25:02,880 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 22:25:02,881 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-11 22:25:02,881 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 22:25:02,882 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 22:25:02,882 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 22:25:02,882 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 22:25:02,882 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 22:25:02,883 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 22:25:02,883 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 22:25:02,885 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:25:03,004 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 22:25:03,006 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 22:25:03,205 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 22:25:03,211 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 22:25:03,212 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 22:25:03,213 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:25:03 BoogieIcfgContainer
[2024-03-11 22:25:03,213 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 22:25:03,215 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 22:25:03,215 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 22:25:03,217 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 22:25:03,218 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 10:25:02" (1/3) ...
[2024-03-11 22:25:03,218 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e7c4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:25:03, skipping insertion in model container
[2024-03-11 22:25:03,218 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:02" (2/3) ...
[2024-03-11 22:25:03,219 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e7c4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:25:03, skipping insertion in model container
[2024-03-11 22:25:03,219 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:25:03" (3/3) ...
[2024-03-11 22:25:03,220 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array-race.i
[2024-03-11 22:25:03,227 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 22:25:03,235 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 22:25:03,235 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-03-11 22:25:03,235 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 22:25:03,276 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 22:25:03,304 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:03,354 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2024-03-11 22:25:03,355 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:25:03,359 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2024-03-11 22:25:03,359 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:03,362 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:03,365 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:25:03,373 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:03,375 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:03,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:03,407 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2024-03-11 22:25:03,407 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:25:03,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2024-03-11 22:25:03,409 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2024-03-11 22:25:06,125 INFO  L134        LiptonReduction]: Checked pairs total: 10110
[2024-03-11 22:25:06,125 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2024-03-11 22:25:06,138 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:25:06,144 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;@34da11ae, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:25:06,144 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-11 22:25:06,148 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2024-03-11 22:25:06,148 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:25:06,149 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:06,149 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:06,150 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:06,154 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:06,154 INFO  L85        PathProgramCache]: Analyzing trace with hash 2110203502, now seen corresponding path program 1 times
[2024-03-11 22:25:06,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:06,161 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843897734]
[2024-03-11 22:25:06,162 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:06,162 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:06,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:06,574 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:25:06,574 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:06,575 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843897734]
[2024-03-11 22:25:06,575 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843897734] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:06,575 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:06,576 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:06,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445236006]
[2024-03-11 22:25:06,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:06,583 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:06,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:06,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:06,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:06,996 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 197
[2024-03-11 22:25:06,999 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:06,999 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:07,000 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 197
[2024-03-11 22:25:07,000 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:07,216 INFO  L130       PetriNetUnfolder]: 136/491 cut-off events.
[2024-03-11 22:25:07,217 INFO  L131       PetriNetUnfolder]: For 8/12 co-relation queries the response was YES.
[2024-03-11 22:25:07,219 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 831 conditions, 491 events. 136/491 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2634 event pairs, 41 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 746. Up to 213 conditions per place. 
[2024-03-11 22:25:07,223 INFO  L137   encePairwiseOnDemand]: 181/197 looper letters, 45 selfloop transitions, 23 changer transitions 0/97 dead transitions.
[2024-03-11 22:25:07,223 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 338 flow
[2024-03-11 22:25:07,225 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:07,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:07,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 658 transitions.
[2024-03-11 22:25:07,238 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.55668358714044
[2024-03-11 22:25:07,239 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 658 transitions.
[2024-03-11 22:25:07,239 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 658 transitions.
[2024-03-11 22:25:07,241 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:07,243 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 658 transitions.
[2024-03-11 22:25:07,247 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 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:25:07,253 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:07,253 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:07,255 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 658 transitions.
[2024-03-11 22:25:07,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 338 flow
[2024-03-11 22:25:07,258 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 97 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:07,260 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2024-03-11 22:25:07,261 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2024-03-11 22:25:07,264 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2024-03-11 22:25:07,265 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2024-03-11 22:25:07,265 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:07,265 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:07,265 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:07,266 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 22:25:07,266 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:07,266 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:07,267 INFO  L85        PathProgramCache]: Analyzing trace with hash -1448158064, now seen corresponding path program 1 times
[2024-03-11 22:25:07,267 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:07,267 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342976276]
[2024-03-11 22:25:07,267 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:07,267 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:07,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:07,317 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:25:07,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:07,317 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342976276]
[2024-03-11 22:25:07,317 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342976276] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:07,318 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:07,318 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:25:07,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357284760]
[2024-03-11 22:25:07,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:07,319 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:25:07,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:07,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:25:07,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:25:07,367 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 197
[2024-03-11 22:25:07,368 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 292 flow. Second operand  has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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:25:07,368 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:07,368 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 197
[2024-03-11 22:25:07,368 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:07,466 INFO  L130       PetriNetUnfolder]: 75/431 cut-off events.
[2024-03-11 22:25:07,466 INFO  L131       PetriNetUnfolder]: For 99/103 co-relation queries the response was YES.
[2024-03-11 22:25:07,469 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 838 conditions, 431 events. 75/431 cut-off events. For 99/103 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2391 event pairs, 10 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 711. Up to 90 conditions per place. 
[2024-03-11 22:25:07,471 INFO  L137   encePairwiseOnDemand]: 193/197 looper letters, 22 selfloop transitions, 3 changer transitions 2/89 dead transitions.
[2024-03-11 22:25:07,471 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 89 transitions, 374 flow
[2024-03-11 22:25:07,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:25:07,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:25:07,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions.
[2024-03-11 22:25:07,475 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5951776649746193
[2024-03-11 22:25:07,475 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 469 transitions.
[2024-03-11 22:25:07,475 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions.
[2024-03-11 22:25:07,475 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:07,475 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions.
[2024-03-11 22:25:07,477 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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:25:07,478 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 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:25:07,479 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 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:25:07,479 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 4 states and 469 transitions.
[2024-03-11 22:25:07,479 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 89 transitions, 374 flow
[2024-03-11 22:25:07,481 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 374 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:07,483 INFO  L231             Difference]: Finished difference. Result has 74 places, 81 transitions, 308 flow
[2024-03-11 22:25:07,483 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=74, PETRI_TRANSITIONS=81}
[2024-03-11 22:25:07,483 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places.
[2024-03-11 22:25:07,484 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 308 flow
[2024-03-11 22:25:07,484 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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:25:07,484 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:07,484 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:07,485 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 22:25:07,485 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:07,485 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:07,485 INFO  L85        PathProgramCache]: Analyzing trace with hash -1143403716, now seen corresponding path program 1 times
[2024-03-11 22:25:07,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:07,486 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83024487]
[2024-03-11 22:25:07,486 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:07,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:07,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:07,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:07,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:07,640 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83024487]
[2024-03-11 22:25:07,640 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83024487] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:07,640 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:07,641 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:07,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354475914]
[2024-03-11 22:25:07,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:07,641 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:07,641 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:07,642 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:07,642 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:07,846 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 197
[2024-03-11 22:25:07,847 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 308 flow. Second operand  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:07,847 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:07,847 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 197
[2024-03-11 22:25:07,847 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:08,042 INFO  L130       PetriNetUnfolder]: 273/845 cut-off events.
[2024-03-11 22:25:08,042 INFO  L131       PetriNetUnfolder]: For 339/348 co-relation queries the response was YES.
[2024-03-11 22:25:08,044 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 845 events. 273/845 cut-off events. For 339/348 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5087 event pairs, 40 based on Foata normal form. 5/825 useless extension candidates. Maximal degree in co-relation 1909. Up to 380 conditions per place. 
[2024-03-11 22:25:08,048 INFO  L137   encePairwiseOnDemand]: 174/197 looper letters, 71 selfloop transitions, 50 changer transitions 1/152 dead transitions.
[2024-03-11 22:25:08,048 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 152 transitions, 818 flow
[2024-03-11 22:25:08,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:08,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:08,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-11 22:25:08,052 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5423011844331641
[2024-03-11 22:25:08,052 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-11 22:25:08,052 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-11 22:25:08,053 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:08,053 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-11 22:25:08,054 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:08,056 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:08,057 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:08,057 INFO  L175             Difference]: Start difference. First operand has 74 places, 81 transitions, 308 flow. Second operand 6 states and 641 transitions.
[2024-03-11 22:25:08,057 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 152 transitions, 818 flow
[2024-03-11 22:25:08,060 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 152 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:25:08,062 INFO  L231             Difference]: Finished difference. Result has 83 places, 129 transitions, 778 flow
[2024-03-11 22:25:08,062 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=778, PETRI_PLACES=83, PETRI_TRANSITIONS=129}
[2024-03-11 22:25:08,062 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 24 predicate places.
[2024-03-11 22:25:08,063 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 129 transitions, 778 flow
[2024-03-11 22:25:08,063 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:08,063 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:08,063 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]
[2024-03-11 22:25:08,064 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 22:25:08,064 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:08,064 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:08,064 INFO  L85        PathProgramCache]: Analyzing trace with hash -2008836030, now seen corresponding path program 1 times
[2024-03-11 22:25:08,064 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:08,065 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406902804]
[2024-03-11 22:25:08,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:08,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:08,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:08,312 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:25:08,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:08,312 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406902804]
[2024-03-11 22:25:08,313 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406902804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:08,313 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:08,313 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:08,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389813935]
[2024-03-11 22:25:08,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:08,314 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:08,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:08,314 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:08,314 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:08,440 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197
[2024-03-11 22:25:08,441 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 129 transitions, 778 flow. Second operand  has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 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:25:08,441 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:08,441 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197
[2024-03-11 22:25:08,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:08,977 INFO  L130       PetriNetUnfolder]: 495/1281 cut-off events.
[2024-03-11 22:25:08,978 INFO  L131       PetriNetUnfolder]: For 1253/1267 co-relation queries the response was YES.
[2024-03-11 22:25:08,981 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4152 conditions, 1281 events. 495/1281 cut-off events. For 1253/1267 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8062 event pairs, 83 based on Foata normal form. 2/1205 useless extension candidates. Maximal degree in co-relation 3944. Up to 935 conditions per place. 
[2024-03-11 22:25:08,987 INFO  L137   encePairwiseOnDemand]: 167/197 looper letters, 138 selfloop transitions, 107 changer transitions 6/267 dead transitions.
[2024-03-11 22:25:08,987 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 267 transitions, 1868 flow
[2024-03-11 22:25:08,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:08,988 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:08,989 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 680 transitions.
[2024-03-11 22:25:08,990 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5752961082910322
[2024-03-11 22:25:08,990 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 680 transitions.
[2024-03-11 22:25:08,990 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 680 transitions.
[2024-03-11 22:25:08,990 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:08,991 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 680 transitions.
[2024-03-11 22:25:08,992 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 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:25:08,994 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:08,994 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:08,994 INFO  L175             Difference]: Start difference. First operand has 83 places, 129 transitions, 778 flow. Second operand 6 states and 680 transitions.
[2024-03-11 22:25:08,995 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 267 transitions, 1868 flow
[2024-03-11 22:25:09,002 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 267 transitions, 1852 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-03-11 22:25:09,005 INFO  L231             Difference]: Finished difference. Result has 89 places, 233 transitions, 1622 flow
[2024-03-11 22:25:09,006 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1622, PETRI_PLACES=89, PETRI_TRANSITIONS=233}
[2024-03-11 22:25:09,006 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2024-03-11 22:25:09,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 233 transitions, 1622 flow
[2024-03-11 22:25:09,007 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 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:25:09,007 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:09,007 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:09,007 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 22:25:09,008 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:09,008 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:09,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 1403069832, now seen corresponding path program 1 times
[2024-03-11 22:25:09,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:09,008 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478663371]
[2024-03-11 22:25:09,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:09,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:09,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:09,346 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:25:09,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:09,346 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478663371]
[2024-03-11 22:25:09,346 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478663371] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:09,347 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716604923]
[2024-03-11 22:25:09,347 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:09,347 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:09,347 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:09,348 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:25:09,361 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:25:09,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:09,493 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-03-11 22:25:09,501 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:09,566 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:25:09,686 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:25:09,713 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:09,714 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:25:09,748 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:09,750 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:09,751 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:25:09,799 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:09,802 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:09,803 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:09,805 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:25:09,856 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:09,858 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:25:09,885 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:25:09,886 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:09,919 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2024-03-11 22:25:09,951 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_229 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0))))) is different from false
[2024-03-11 22:25:09,973 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))))) is different from false
[2024-03-11 22:25:10,085 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:25:10,086 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716604923] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:10,086 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:10,086 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2024-03-11 22:25:10,086 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131915159]
[2024-03-11 22:25:10,086 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:10,087 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-03-11 22:25:10,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:10,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-03-11 22:25:10,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=460, Unknown=3, NotChecked=138, Total=702
[2024-03-11 22:25:10,174 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 197
[2024-03-11 22:25:10,176 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 233 transitions, 1622 flow. Second operand  has 27 states, 27 states have (on average 61.592592592592595) internal successors, (1663), 27 states have internal predecessors, (1663), 0 states have call successors, (0), 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:25:10,176 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:10,176 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 197
[2024-03-11 22:25:10,176 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:10,894 INFO  L130       PetriNetUnfolder]: 625/1459 cut-off events.
[2024-03-11 22:25:10,895 INFO  L131       PetriNetUnfolder]: For 2534/2534 co-relation queries the response was YES.
[2024-03-11 22:25:10,897 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6008 conditions, 1459 events. 625/1459 cut-off events. For 2534/2534 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8869 event pairs, 88 based on Foata normal form. 10/1361 useless extension candidates. Maximal degree in co-relation 5782. Up to 1332 conditions per place. 
[2024-03-11 22:25:10,903 INFO  L137   encePairwiseOnDemand]: 187/197 looper letters, 277 selfloop transitions, 12 changer transitions 8/299 dead transitions.
[2024-03-11 22:25:10,903 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 299 transitions, 2568 flow
[2024-03-11 22:25:10,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-11 22:25:10,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-11 22:25:10,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2024-03-11 22:25:10,905 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3598984771573604
[2024-03-11 22:25:10,905 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2024-03-11 22:25:10,906 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2024-03-11 22:25:10,906 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:10,906 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2024-03-11 22:25:10,908 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 70.9) internal successors, (709), 10 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:10,910 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:10,910 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:10,911 INFO  L175             Difference]: Start difference. First operand has 89 places, 233 transitions, 1622 flow. Second operand 10 states and 709 transitions.
[2024-03-11 22:25:10,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 299 transitions, 2568 flow
[2024-03-11 22:25:10,927 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 299 transitions, 2448 flow, removed 60 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:10,931 INFO  L231             Difference]: Finished difference. Result has 99 places, 236 transitions, 1543 flow
[2024-03-11 22:25:10,931 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1543, PETRI_PLACES=99, PETRI_TRANSITIONS=236}
[2024-03-11 22:25:10,931 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 40 predicate places.
[2024-03-11 22:25:10,932 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 236 transitions, 1543 flow
[2024-03-11 22:25:10,932 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 61.592592592592595) internal successors, (1663), 27 states have internal predecessors, (1663), 0 states have call successors, (0), 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:25:10,932 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:10,933 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:10,941 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-11 22:25:11,133 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:11,134 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:11,134 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:11,134 INFO  L85        PathProgramCache]: Analyzing trace with hash 1125172485, now seen corresponding path program 1 times
[2024-03-11 22:25:11,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:11,135 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093173927]
[2024-03-11 22:25:11,135 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:11,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:11,165 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:11,448 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:25:11,448 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:11,448 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093173927]
[2024-03-11 22:25:11,449 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093173927] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:11,449 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287274639]
[2024-03-11 22:25:11,449 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:11,449 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:11,449 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:11,450 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:25:11,452 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:25:11,560 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:11,561 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-11 22:25:11,563 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:11,586 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:25:11,640 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:25:11,661 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:25:11,690 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:11,691 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:25:11,731 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:11,732 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:25:11,769 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:11,770 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:25:11,777 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:25:11,777 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:11,817 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:25:11,841 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-11 22:25:11,865 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_342 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:25:11,967 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:25:11,968 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287274639] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:11,968 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:11,968 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-03-11 22:25:11,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140504084]
[2024-03-11 22:25:11,968 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:11,969 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:25:11,969 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:11,970 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:25:11,970 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2024-03-11 22:25:12,084 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 197
[2024-03-11 22:25:12,086 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 236 transitions, 1543 flow. Second operand  has 26 states, 26 states have (on average 59.65384615384615) internal successors, (1551), 26 states have internal predecessors, (1551), 0 states have call successors, (0), 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:25:12,086 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:12,086 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 197
[2024-03-11 22:25:12,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:15,428 INFO  L130       PetriNetUnfolder]: 714/1654 cut-off events.
[2024-03-11 22:25:15,429 INFO  L131       PetriNetUnfolder]: For 2948/2948 co-relation queries the response was YES.
[2024-03-11 22:25:15,432 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6975 conditions, 1654 events. 714/1654 cut-off events. For 2948/2948 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 10404 event pairs, 57 based on Foata normal form. 0/1555 useless extension candidates. Maximal degree in co-relation 6730. Up to 980 conditions per place. 
[2024-03-11 22:25:15,438 INFO  L137   encePairwiseOnDemand]: 146/197 looper letters, 256 selfloop transitions, 236 changer transitions 33/527 dead transitions.
[2024-03-11 22:25:15,438 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 527 transitions, 4274 flow
[2024-03-11 22:25:15,438 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-11 22:25:15,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-11 22:25:15,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1554 transitions.
[2024-03-11 22:25:15,442 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3756345177664975
[2024-03-11 22:25:15,442 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1554 transitions.
[2024-03-11 22:25:15,443 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1554 transitions.
[2024-03-11 22:25:15,443 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:15,444 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1554 transitions.
[2024-03-11 22:25:15,446 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 74.0) internal successors, (1554), 21 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:15,450 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:15,451 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 197.0) internal successors, (4334), 22 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:15,452 INFO  L175             Difference]: Start difference. First operand has 99 places, 236 transitions, 1543 flow. Second operand 21 states and 1554 transitions.
[2024-03-11 22:25:15,452 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 527 transitions, 4274 flow
[2024-03-11 22:25:15,465 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 527 transitions, 4243 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-03-11 22:25:15,470 INFO  L231             Difference]: Finished difference. Result has 123 places, 369 transitions, 3371 flow
[2024-03-11 22:25:15,470 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3371, PETRI_PLACES=123, PETRI_TRANSITIONS=369}
[2024-03-11 22:25:15,471 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 64 predicate places.
[2024-03-11 22:25:15,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 369 transitions, 3371 flow
[2024-03-11 22:25:15,472 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 59.65384615384615) internal successors, (1551), 26 states have internal predecessors, (1551), 0 states have call successors, (0), 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:25:15,472 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:15,472 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]
[2024-03-11 22:25:15,477 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:25:15,677 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:15,678 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:15,679 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:15,680 INFO  L85        PathProgramCache]: Analyzing trace with hash -649414092, now seen corresponding path program 1 times
[2024-03-11 22:25:15,680 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:15,681 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720920798]
[2024-03-11 22:25:15,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:15,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:15,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:16,090 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:25:16,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:16,091 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720920798]
[2024-03-11 22:25:16,091 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720920798] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:16,091 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238376099]
[2024-03-11 22:25:16,091 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:16,091 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:16,092 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:16,093 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:25:16,098 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:25:16,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:16,219 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 44 conjunts are in the unsatisfiable core
[2024-03-11 22:25:16,223 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:16,269 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:25:16,276 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:25:16,410 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:25:16,442 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:16,444 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:25:16,486 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:16,487 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:16,488 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:25:16,527 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:16,528 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:16,529 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:16,530 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:25:16,575 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:16,578 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:25:16,607 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:25:16,607 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:16,640 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:25:16,671 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:25:16,691 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:25:16,814 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:25:16,814 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [238376099] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:16,814 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:16,815 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2024-03-11 22:25:16,815 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740867467]
[2024-03-11 22:25:16,815 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:16,815 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-03-11 22:25:16,815 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:16,816 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-03-11 22:25:16,816 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=461, Unknown=3, NotChecked=138, Total=702
[2024-03-11 22:25:16,965 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 43 out of 197
[2024-03-11 22:25:16,966 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 369 transitions, 3371 flow. Second operand  has 27 states, 27 states have (on average 45.7037037037037) internal successors, (1234), 27 states have internal predecessors, (1234), 0 states have call successors, (0), 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:25:16,966 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:16,966 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 197
[2024-03-11 22:25:16,967 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:22,796 INFO  L130       PetriNetUnfolder]: 1175/2744 cut-off events.
[2024-03-11 22:25:22,796 INFO  L131       PetriNetUnfolder]: For 10649/10651 co-relation queries the response was YES.
[2024-03-11 22:25:22,804 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15223 conditions, 2744 events. 1175/2744 cut-off events. For 10649/10651 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 19793 event pairs, 68 based on Foata normal form. 102/2788 useless extension candidates. Maximal degree in co-relation 14803. Up to 941 conditions per place. 
[2024-03-11 22:25:22,817 INFO  L137   encePairwiseOnDemand]: 146/197 looper letters, 543 selfloop transitions, 455 changer transitions 25/1025 dead transitions.
[2024-03-11 22:25:22,817 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 1025 transitions, 10563 flow
[2024-03-11 22:25:22,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2024-03-11 22:25:22,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2024-03-11 22:25:22,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1807 transitions.
[2024-03-11 22:25:22,822 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.31629616663749344
[2024-03-11 22:25:22,822 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 1807 transitions.
[2024-03-11 22:25:22,822 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 1807 transitions.
[2024-03-11 22:25:22,823 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:22,823 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1807 transitions.
[2024-03-11 22:25:22,826 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 62.310344827586206) internal successors, (1807), 29 states have internal predecessors, (1807), 0 states have call successors, (0), 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:25:22,846 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 197.0) internal successors, (5910), 30 states have internal predecessors, (5910), 0 states have call successors, (0), 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:25:22,847 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 197.0) internal successors, (5910), 30 states have internal predecessors, (5910), 0 states have call successors, (0), 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:25:22,847 INFO  L175             Difference]: Start difference. First operand has 123 places, 369 transitions, 3371 flow. Second operand 29 states and 1807 transitions.
[2024-03-11 22:25:22,847 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 1025 transitions, 10563 flow
[2024-03-11 22:25:22,909 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 1025 transitions, 10315 flow, removed 78 selfloop flow, removed 8 redundant places.
[2024-03-11 22:25:22,918 INFO  L231             Difference]: Finished difference. Result has 156 places, 653 transitions, 7362 flow
[2024-03-11 22:25:22,919 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=3221, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=7362, PETRI_PLACES=156, PETRI_TRANSITIONS=653}
[2024-03-11 22:25:22,919 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 97 predicate places.
[2024-03-11 22:25:22,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 653 transitions, 7362 flow
[2024-03-11 22:25:22,920 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 45.7037037037037) internal successors, (1234), 27 states have internal predecessors, (1234), 0 states have call successors, (0), 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:25:22,920 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:22,920 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]
[2024-03-11 22:25:22,925 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:25:23,122 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:23,122 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:23,123 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:23,123 INFO  L85        PathProgramCache]: Analyzing trace with hash -1789107804, now seen corresponding path program 1 times
[2024-03-11 22:25:23,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:23,124 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983203832]
[2024-03-11 22:25:23,124 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:23,125 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:23,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:23,468 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:25:23,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:23,468 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983203832]
[2024-03-11 22:25:23,469 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983203832] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:23,469 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489334365]
[2024-03-11 22:25:23,469 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:23,469 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:23,469 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:23,470 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:25:23,472 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:25:23,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:23,624 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-03-11 22:25:23,628 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:23,653 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:25:23,740 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:25:23,770 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:23,771 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:25:23,804 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:23,805 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:23,806 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:25:23,853 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:23,855 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:23,856 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:23,857 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:25:23,933 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:23,934 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:25:23,962 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:25:23,962 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:23,978 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-11 22:25:24,021 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37))) (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37))) (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37))) (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37)))) is different from false
[2024-03-11 22:25:24,300 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37))) (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37))) (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37)))))) is different from false
[2024-03-11 22:25:24,479 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:24,480 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:25:24,490 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:24,491 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:25:24,497 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:25:24,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:25:24,590 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [489334365] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:24,590 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:24,590 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2024-03-11 22:25:24,591 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698258547]
[2024-03-11 22:25:24,591 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:24,591 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-03-11 22:25:24,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:24,592 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-03-11 22:25:24,592 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=523, Unknown=13, NotChecked=150, Total=812
[2024-03-11 22:25:24,754 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 197
[2024-03-11 22:25:24,756 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 653 transitions, 7362 flow. Second operand  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:24,756 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:24,756 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 197
[2024-03-11 22:25:24,756 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:26,391 INFO  L130       PetriNetUnfolder]: 1108/2590 cut-off events.
[2024-03-11 22:25:26,391 INFO  L131       PetriNetUnfolder]: For 19586/19592 co-relation queries the response was YES.
[2024-03-11 22:25:26,399 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17579 conditions, 2590 events. 1108/2590 cut-off events. For 19586/19592 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 18388 event pairs, 113 based on Foata normal form. 67/2599 useless extension candidates. Maximal degree in co-relation 17099. Up to 2416 conditions per place. 
[2024-03-11 22:25:26,411 INFO  L137   encePairwiseOnDemand]: 186/197 looper letters, 618 selfloop transitions, 42 changer transitions 1/663 dead transitions.
[2024-03-11 22:25:26,411 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 663 transitions, 8756 flow
[2024-03-11 22:25:26,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-11 22:25:26,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-11 22:25:26,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 674 transitions.
[2024-03-11 22:25:26,414 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34213197969543147
[2024-03-11 22:25:26,414 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 674 transitions.
[2024-03-11 22:25:26,414 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 674 transitions.
[2024-03-11 22:25:26,414 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:26,414 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 674 transitions.
[2024-03-11 22:25:26,416 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 67.4) internal successors, (674), 10 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:25:26,417 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:26,418 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:26,418 INFO  L175             Difference]: Start difference. First operand has 156 places, 653 transitions, 7362 flow. Second operand 10 states and 674 transitions.
[2024-03-11 22:25:26,418 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 663 transitions, 8756 flow
[2024-03-11 22:25:26,545 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 663 transitions, 8475 flow, removed 123 selfloop flow, removed 11 redundant places.
[2024-03-11 22:25:26,554 INFO  L231             Difference]: Finished difference. Result has 152 places, 618 transitions, 6807 flow
[2024-03-11 22:25:26,554 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=6715, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6807, PETRI_PLACES=152, PETRI_TRANSITIONS=618}
[2024-03-11 22:25:26,554 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 93 predicate places.
[2024-03-11 22:25:26,555 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 618 transitions, 6807 flow
[2024-03-11 22:25:26,555 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:26,555 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:26,555 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:26,561 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:25:26,759 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:26,760 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:26,760 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:26,761 INFO  L85        PathProgramCache]: Analyzing trace with hash -1574926783, now seen corresponding path program 1 times
[2024-03-11 22:25:26,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:26,761 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148653216]
[2024-03-11 22:25:26,761 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:26,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:26,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:26,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:25:26,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:26,977 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148653216]
[2024-03-11 22:25:26,977 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148653216] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:26,978 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:26,978 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:26,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356556919]
[2024-03-11 22:25:26,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:26,978 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:26,978 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:26,978 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:26,979 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:27,313 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197
[2024-03-11 22:25:27,314 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 618 transitions, 6807 flow. Second operand  has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 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:25:27,314 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:27,314 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197
[2024-03-11 22:25:27,314 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:27,865 INFO  L130       PetriNetUnfolder]: 964/2420 cut-off events.
[2024-03-11 22:25:27,865 INFO  L131       PetriNetUnfolder]: For 17842/17953 co-relation queries the response was YES.
[2024-03-11 22:25:27,874 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15352 conditions, 2420 events. 964/2420 cut-off events. For 17842/17953 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 18016 event pairs, 47 based on Foata normal form. 35/2394 useless extension candidates. Maximal degree in co-relation 14918. Up to 1298 conditions per place. 
[2024-03-11 22:25:27,881 INFO  L137   encePairwiseOnDemand]: 186/197 looper letters, 279 selfloop transitions, 75 changer transitions 28/683 dead transitions.
[2024-03-11 22:25:27,882 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 683 transitions, 8393 flow
[2024-03-11 22:25:27,882 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:27,882 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:27,883 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 667 transitions.
[2024-03-11 22:25:27,883 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5642978003384095
[2024-03-11 22:25:27,884 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 667 transitions.
[2024-03-11 22:25:27,884 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 667 transitions.
[2024-03-11 22:25:27,884 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:27,884 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 667 transitions.
[2024-03-11 22:25:27,885 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 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:25:27,886 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,887 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,887 INFO  L175             Difference]: Start difference. First operand has 152 places, 618 transitions, 6807 flow. Second operand 6 states and 667 transitions.
[2024-03-11 22:25:27,887 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 683 transitions, 8393 flow
[2024-03-11 22:25:28,000 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 683 transitions, 8303 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-03-11 22:25:28,008 INFO  L231             Difference]: Finished difference. Result has 154 places, 651 transitions, 7588 flow
[2024-03-11 22:25:28,008 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=6725, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7588, PETRI_PLACES=154, PETRI_TRANSITIONS=651}
[2024-03-11 22:25:28,009 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 95 predicate places.
[2024-03-11 22:25:28,009 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 651 transitions, 7588 flow
[2024-03-11 22:25:28,009 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 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:25:28,009 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:28,010 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:28,010 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-11 22:25:28,010 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:28,010 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:28,010 INFO  L85        PathProgramCache]: Analyzing trace with hash -803696675, now seen corresponding path program 2 times
[2024-03-11 22:25:28,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:28,010 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558613941]
[2024-03-11 22:25:28,010 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:28,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:28,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:28,459 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:28,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:28,459 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558613941]
[2024-03-11 22:25:28,460 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558613941] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:28,460 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545378593]
[2024-03-11 22:25:28,460 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:25:28,460 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:28,460 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:28,461 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:25:28,465 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:25:28,587 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:25:28,587 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:25:28,589 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core
[2024-03-11 22:25:28,592 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:28,618 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2024-03-11 22:25:28,723 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:25:28,768 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:25:28,800 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:28,800 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:25:28,857 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:28,858 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:25:28,947 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:28,948 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:25:28,970 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:28,971 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:25:28,993 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:28,994 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:25:29,018 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:29,018 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:25:29,089 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:29,089 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:25:29,099 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:29,099 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:29,119 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_753 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_753 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_753 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_753 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset)))) is different from false
[2024-03-11 22:25:29,163 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:25:29,357 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_753 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_752) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_753) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset)))))) is different from false
[2024-03-11 22:25:29,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked.
[2024-03-11 22:25:29,591 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545378593] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:29,591 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:29,591 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27
[2024-03-11 22:25:29,591 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345347933]
[2024-03-11 22:25:29,591 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:29,592 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-03-11 22:25:29,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:29,592 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-03-11 22:25:29,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=540, Unknown=9, NotChecked=150, Total=812
[2024-03-11 22:25:29,594 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 197
[2024-03-11 22:25:29,596 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 651 transitions, 7588 flow. Second operand  has 29 states, 29 states have (on average 56.93103448275862) internal successors, (1651), 29 states have internal predecessors, (1651), 0 states have call successors, (0), 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:25:29,596 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:29,596 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 197
[2024-03-11 22:25:29,597 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:33,015 INFO  L130       PetriNetUnfolder]: 1077/2501 cut-off events.
[2024-03-11 22:25:33,015 INFO  L131       PetriNetUnfolder]: For 20156/20164 co-relation queries the response was YES.
[2024-03-11 22:25:33,023 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17345 conditions, 2501 events. 1077/2501 cut-off events. For 20156/20164 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 18196 event pairs, 20 based on Foata normal form. 49/2533 useless extension candidates. Maximal degree in co-relation 17178. Up to 803 conditions per place. 
[2024-03-11 22:25:33,030 INFO  L137   encePairwiseOnDemand]: 150/197 looper letters, 477 selfloop transitions, 344 changer transitions 78/901 dead transitions.
[2024-03-11 22:25:33,031 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 901 transitions, 12012 flow
[2024-03-11 22:25:33,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-11 22:25:33,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-11 22:25:33,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1327 transitions.
[2024-03-11 22:25:33,034 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3545284531124766
[2024-03-11 22:25:33,034 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1327 transitions.
[2024-03-11 22:25:33,034 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1327 transitions.
[2024-03-11 22:25:33,035 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:33,035 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1327 transitions.
[2024-03-11 22:25:33,037 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 69.84210526315789) internal successors, (1327), 19 states have internal predecessors, (1327), 0 states have call successors, (0), 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:25:33,040 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:33,040 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:33,040 INFO  L175             Difference]: Start difference. First operand has 154 places, 651 transitions, 7588 flow. Second operand 19 states and 1327 transitions.
[2024-03-11 22:25:33,041 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 901 transitions, 12012 flow
[2024-03-11 22:25:33,149 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 901 transitions, 11798 flow, removed 107 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:33,159 INFO  L231             Difference]: Finished difference. Result has 175 places, 642 transitions, 8370 flow
[2024-03-11 22:25:33,160 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=7384, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=322, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8370, PETRI_PLACES=175, PETRI_TRANSITIONS=642}
[2024-03-11 22:25:33,160 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 116 predicate places.
[2024-03-11 22:25:33,160 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 642 transitions, 8370 flow
[2024-03-11 22:25:33,161 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 56.93103448275862) internal successors, (1651), 29 states have internal predecessors, (1651), 0 states have call successors, (0), 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:25:33,161 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:33,161 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-11 22:25:33,170 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-03-11 22:25:33,363 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,SelfDestructingSolverStorable9
[2024-03-11 22:25:33,363 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:33,364 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:33,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -103590415, now seen corresponding path program 1 times
[2024-03-11 22:25:33,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:33,364 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184168527]
[2024-03-11 22:25:33,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:33,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:33,405 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:25:33,405 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:25:33,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:25:33,436 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:25:33,436 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:25:33,437 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-11 22:25:33,438 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-11 22:25:33,439 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-11 22:25:33,439 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-11 22:25:33,439 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-11 22:25:33,439 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-11 22:25:33,439 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-11 22:25:33,439 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-11 22:25:33,439 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-11 22:25:33,439 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-11 22:25:33,439 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:33,441 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:25:33,441 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 22:25:33,456 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 22:25:33,457 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:33,475 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2024-03-11 22:25:33,475 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:25:33,476 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 721 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2024-03-11 22:25:33,476 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:33,477 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:33,477 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:25:33,477 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:33,477 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:33,477 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:33,494 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2024-03-11 22:25:33,494 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:25:33,494 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 721 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2024-03-11 22:25:33,497 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2024-03-11 22:25:36,362 INFO  L134        LiptonReduction]: Checked pairs total: 24448
[2024-03-11 22:25:36,362 INFO  L136        LiptonReduction]: Total number of compositions: 77
[2024-03-11 22:25:36,364 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:25:36,365 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;@34da11ae, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:25:36,365 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-11 22:25:36,368 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2024-03-11 22:25:36,368 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:25:36,368 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:36,368 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:36,368 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:36,369 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:36,369 INFO  L85        PathProgramCache]: Analyzing trace with hash 1025009828, now seen corresponding path program 1 times
[2024-03-11 22:25:36,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:36,369 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452954510]
[2024-03-11 22:25:36,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:36,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:36,379 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:36,479 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:25:36,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:36,479 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452954510]
[2024-03-11 22:25:36,480 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452954510] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:36,480 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:36,480 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:36,480 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441763975]
[2024-03-11 22:25:36,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:36,480 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:36,480 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:36,481 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:36,481 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:36,674 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 216
[2024-03-11 22:25:36,674 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 154 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:36,674 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:36,675 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 216
[2024-03-11 22:25:36,675 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:37,271 INFO  L130       PetriNetUnfolder]: 2688/5657 cut-off events.
[2024-03-11 22:25:37,271 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2024-03-11 22:25:37,276 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10270 conditions, 5657 events. 2688/5657 cut-off events. For 191/349 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 39599 event pairs, 783 based on Foata normal form. 0/5257 useless extension candidates. Maximal degree in co-relation 4885. Up to 3254 conditions per place. 
[2024-03-11 22:25:37,285 INFO  L137   encePairwiseOnDemand]: 196/216 looper letters, 67 selfloop transitions, 42 changer transitions 0/141 dead transitions.
[2024-03-11 22:25:37,285 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 141 transitions, 526 flow
[2024-03-11 22:25:37,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:37,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:37,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions.
[2024-03-11 22:25:37,287 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5902777777777778
[2024-03-11 22:25:37,287 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 765 transitions.
[2024-03-11 22:25:37,287 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions.
[2024-03-11 22:25:37,287 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:37,287 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions.
[2024-03-11 22:25:37,288 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 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:25:37,290 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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:25:37,290 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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:25:37,290 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 765 transitions.
[2024-03-11 22:25:37,290 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 141 transitions, 526 flow
[2024-03-11 22:25:37,291 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 141 transitions, 526 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:37,292 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2024-03-11 22:25:37,292 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=81, PETRI_TRANSITIONS=110}
[2024-03-11 22:25:37,293 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2024-03-11 22:25:37,293 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2024-03-11 22:25:37,293 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:37,293 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:37,293 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:37,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-11 22:25:37,293 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:37,293 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:37,294 INFO  L85        PathProgramCache]: Analyzing trace with hash 702034174, now seen corresponding path program 1 times
[2024-03-11 22:25:37,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:37,294 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772979469]
[2024-03-11 22:25:37,294 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:37,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:37,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:37,321 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:25:37,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:37,322 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772979469]
[2024-03-11 22:25:37,322 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772979469] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:37,322 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:37,322 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:25:37,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473792733]
[2024-03-11 22:25:37,322 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:37,323 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:25:37,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:37,323 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:25:37,323 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:25:37,358 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 216
[2024-03-11 22:25:37,359 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 110 transitions, 446 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:37,359 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:37,359 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 216
[2024-03-11 22:25:37,359 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:37,674 INFO  L130       PetriNetUnfolder]: 1404/3806 cut-off events.
[2024-03-11 22:25:37,674 INFO  L131       PetriNetUnfolder]: For 1064/1237 co-relation queries the response was YES.
[2024-03-11 22:25:37,679 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8227 conditions, 3806 events. 1404/3806 cut-off events. For 1064/1237 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 29037 event pairs, 471 based on Foata normal form. 0/3548 useless extension candidates. Maximal degree in co-relation 3324. Up to 1373 conditions per place. 
[2024-03-11 22:25:37,685 INFO  L137   encePairwiseOnDemand]: 212/216 looper letters, 29 selfloop transitions, 3 changer transitions 2/119 dead transitions.
[2024-03-11 22:25:37,685 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 119 transitions, 538 flow
[2024-03-11 22:25:37,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:25:37,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:25:37,686 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions.
[2024-03-11 22:25:37,687 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6168981481481481
[2024-03-11 22:25:37,687 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 533 transitions.
[2024-03-11 22:25:37,687 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions.
[2024-03-11 22:25:37,687 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:37,687 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions.
[2024-03-11 22:25:37,688 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 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:25:37,689 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 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:25:37,689 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 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:25:37,689 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 533 transitions.
[2024-03-11 22:25:37,689 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 119 transitions, 538 flow
[2024-03-11 22:25:37,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 119 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:37,693 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2024-03-11 22:25:37,693 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=86, PETRI_TRANSITIONS=112}
[2024-03-11 22:25:37,693 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2024-03-11 22:25:37,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2024-03-11 22:25:37,694 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:37,694 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:37,694 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:37,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-11 22:25:37,694 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:37,694 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:37,694 INFO  L85        PathProgramCache]: Analyzing trace with hash 978159371, now seen corresponding path program 1 times
[2024-03-11 22:25:37,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:37,694 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784618417]
[2024-03-11 22:25:37,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:37,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:37,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:37,781 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:25:37,781 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:37,782 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784618417]
[2024-03-11 22:25:37,782 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784618417] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:37,782 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:37,782 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:37,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274283016]
[2024-03-11 22:25:37,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:37,782 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:37,782 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:37,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:37,783 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:37,985 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 216
[2024-03-11 22:25:37,987 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 466 flow. Second operand  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:37,987 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:37,987 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 216
[2024-03-11 22:25:37,987 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:39,023 INFO  L130       PetriNetUnfolder]: 6027/11517 cut-off events.
[2024-03-11 22:25:39,023 INFO  L131       PetriNetUnfolder]: For 5796/5964 co-relation queries the response was YES.
[2024-03-11 22:25:39,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29319 conditions, 11517 events. 6027/11517 cut-off events. For 5796/5964 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 84864 event pairs, 1195 based on Foata normal form. 19/11173 useless extension candidates. Maximal degree in co-relation 29191. Up to 6562 conditions per place. 
[2024-03-11 22:25:39,079 INFO  L137   encePairwiseOnDemand]: 189/216 looper letters, 114 selfloop transitions, 104 changer transitions 1/252 dead transitions.
[2024-03-11 22:25:39,079 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 252 transitions, 1498 flow
[2024-03-11 22:25:39,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:39,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:39,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 747 transitions.
[2024-03-11 22:25:39,081 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5763888888888888
[2024-03-11 22:25:39,081 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 747 transitions.
[2024-03-11 22:25:39,081 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 747 transitions.
[2024-03-11 22:25:39,081 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:39,081 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 747 transitions.
[2024-03-11 22:25:39,082 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 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:25:39,083 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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:25:39,084 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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:25:39,084 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 747 transitions.
[2024-03-11 22:25:39,084 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 252 transitions, 1498 flow
[2024-03-11 22:25:39,092 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 252 transitions, 1495 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:25:39,094 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2024-03-11 22:25:39,094 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=95, PETRI_TRANSITIONS=215}
[2024-03-11 22:25:39,094 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2024-03-11 22:25:39,095 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2024-03-11 22:25:39,095 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:39,095 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:39,095 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]
[2024-03-11 22:25:39,095 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-11 22:25:39,095 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:39,096 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:39,096 INFO  L85        PathProgramCache]: Analyzing trace with hash -445029695, now seen corresponding path program 1 times
[2024-03-11 22:25:39,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:39,096 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857291757]
[2024-03-11 22:25:39,096 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:39,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:39,112 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:39,245 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:25:39,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:39,246 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857291757]
[2024-03-11 22:25:39,246 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857291757] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:39,246 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:39,246 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:39,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785216622]
[2024-03-11 22:25:39,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:39,246 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:39,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:39,247 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:39,247 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:39,380 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 216
[2024-03-11 22:25:39,381 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 215 transitions, 1492 flow. Second operand  has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 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:25:39,381 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:39,381 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 216
[2024-03-11 22:25:39,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:41,467 INFO  L130       PetriNetUnfolder]: 10401/18217 cut-off events.
[2024-03-11 22:25:41,467 INFO  L131       PetriNetUnfolder]: For 22474/22699 co-relation queries the response was YES.
[2024-03-11 22:25:41,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61662 conditions, 18217 events. 10401/18217 cut-off events. For 22474/22699 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 130190 event pairs, 3271 based on Foata normal form. 4/17410 useless extension candidates. Maximal degree in co-relation 43305. Up to 14680 conditions per place. 
[2024-03-11 22:25:41,550 INFO  L137   encePairwiseOnDemand]: 182/216 looper letters, 236 selfloop transitions, 178 changer transitions 0/433 dead transitions.
[2024-03-11 22:25:41,551 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 433 transitions, 3380 flow
[2024-03-11 22:25:41,551 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:41,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:41,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 790 transitions.
[2024-03-11 22:25:41,552 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6095679012345679
[2024-03-11 22:25:41,552 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 790 transitions.
[2024-03-11 22:25:41,552 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 790 transitions.
[2024-03-11 22:25:41,552 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:41,552 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 790 transitions.
[2024-03-11 22:25:41,554 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 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:25:41,555 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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:25:41,555 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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:25:41,555 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 790 transitions.
[2024-03-11 22:25:41,555 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 433 transitions, 3380 flow
[2024-03-11 22:25:41,578 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 433 transitions, 3370 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-03-11 22:25:41,583 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2024-03-11 22:25:41,583 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2975, PETRI_PLACES=102, PETRI_TRANSITIONS=377}
[2024-03-11 22:25:41,583 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2024-03-11 22:25:41,583 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2024-03-11 22:25:41,583 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 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:25:41,584 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:41,584 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:41,584 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-11 22:25:41,584 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:41,584 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:41,585 INFO  L85        PathProgramCache]: Analyzing trace with hash 1325300838, now seen corresponding path program 1 times
[2024-03-11 22:25:41,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:41,585 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138895272]
[2024-03-11 22:25:41,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:41,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:41,597 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:41,852 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:25:41,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:41,853 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138895272]
[2024-03-11 22:25:41,853 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138895272] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:41,853 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714078187]
[2024-03-11 22:25:41,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:41,853 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:41,853 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:41,854 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:25:41,856 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:25:41,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:41,994 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-11 22:25:41,997 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:42,017 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:25:42,081 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:25:42,102 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:25:42,130 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:42,130 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:25:42,167 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:42,167 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:25:42,202 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:42,203 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:25:42,211 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:25:42,211 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:42,313 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_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-11 22:25:42,328 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_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1040 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:25:42,428 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:25:42,429 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714078187] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:42,429 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:42,429 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-03-11 22:25:42,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577630630]
[2024-03-11 22:25:42,429 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:42,429 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:25:42,429 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:42,430 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:25:42,430 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=448, Unknown=12, NotChecked=90, Total=650
[2024-03-11 22:25:42,463 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 65 out of 216
[2024-03-11 22:25:42,464 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:42,465 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:42,465 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 216
[2024-03-11 22:25:42,465 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:47,610 INFO  L130       PetriNetUnfolder]: 16562/27029 cut-off events.
[2024-03-11 22:25:47,610 INFO  L131       PetriNetUnfolder]: For 50816/50822 co-relation queries the response was YES.
[2024-03-11 22:25:47,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109425 conditions, 27029 events. 16562/27029 cut-off events. For 50816/50822 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 187783 event pairs, 4731 based on Foata normal form. 6/24531 useless extension candidates. Maximal degree in co-relation 73100. Up to 19181 conditions per place. 
[2024-03-11 22:25:47,763 INFO  L137   encePairwiseOnDemand]: 183/216 looper letters, 551 selfloop transitions, 371 changer transitions 1/926 dead transitions.
[2024-03-11 22:25:47,763 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 926 transitions, 8498 flow
[2024-03-11 22:25:47,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-11 22:25:47,764 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-11 22:25:47,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1563 transitions.
[2024-03-11 22:25:47,766 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4020061728395062
[2024-03-11 22:25:47,766 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1563 transitions.
[2024-03-11 22:25:47,766 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1563 transitions.
[2024-03-11 22:25:47,767 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:47,767 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1563 transitions.
[2024-03-11 22:25:47,769 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 86.83333333333333) internal successors, (1563), 18 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:47,772 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 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:25:47,773 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 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:25:47,773 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 18 states and 1563 transitions.
[2024-03-11 22:25:47,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 926 transitions, 8498 flow
[2024-03-11 22:25:48,219 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 926 transitions, 8378 flow, removed 60 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:48,227 INFO  L231             Difference]: Finished difference. Result has 133 places, 653 transitions, 6935 flow
[2024-03-11 22:25:48,228 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6935, PETRI_PLACES=133, PETRI_TRANSITIONS=653}
[2024-03-11 22:25:48,228 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 62 predicate places.
[2024-03-11 22:25:48,228 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 653 transitions, 6935 flow
[2024-03-11 22:25:48,229 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 67.76923076923077) internal successors, (1762), 26 states have internal predecessors, (1762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:48,229 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:48,229 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:48,237 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-11 22:25:48,429 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,SelfDestructingSolverStorable15
[2024-03-11 22:25:48,430 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:48,431 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:48,431 INFO  L85        PathProgramCache]: Analyzing trace with hash -832876641, now seen corresponding path program 1 times
[2024-03-11 22:25:48,431 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:48,432 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783073980]
[2024-03-11 22:25:48,433 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:48,434 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:48,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:48,762 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:25:48,762 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:48,762 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783073980]
[2024-03-11 22:25:48,763 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783073980] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:48,763 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573433078]
[2024-03-11 22:25:48,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:48,763 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:48,763 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:48,764 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:25:48,765 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:25:48,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:48,880 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-03-11 22:25:48,888 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:48,915 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:25:49,029 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:25:49,066 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:49,067 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:25:49,100 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:49,100 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:49,105 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:25:49,143 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:49,144 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:49,145 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:49,146 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:25:49,186 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:49,187 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:25:49,215 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:25:49,215 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:49,237 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2024-03-11 22:25:49,361 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)))) (and (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1153 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))))) is different from false
[2024-03-11 22:25:49,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:25:49,451 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573433078] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:49,451 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:49,451 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2024-03-11 22:25:49,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871242560]
[2024-03-11 22:25:49,452 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:49,452 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-03-11 22:25:49,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:49,452 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-03-11 22:25:49,452 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=490, Unknown=12, NotChecked=94, Total=702
[2024-03-11 22:25:49,630 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 216
[2024-03-11 22:25:49,631 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 653 transitions, 6935 flow. Second operand  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:49,631 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:49,631 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 216
[2024-03-11 22:25:49,631 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:55,938 INFO  L130       PetriNetUnfolder]: 19191/31668 cut-off events.
[2024-03-11 22:25:55,939 INFO  L131       PetriNetUnfolder]: For 115988/115994 co-relation queries the response was YES.
[2024-03-11 22:25:56,041 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 153960 conditions, 31668 events. 19191/31668 cut-off events. For 115988/115994 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 225945 event pairs, 3529 based on Foata normal form. 230/29097 useless extension candidates. Maximal degree in co-relation 134299. Up to 15944 conditions per place. 
[2024-03-11 22:25:56,167 INFO  L137   encePairwiseOnDemand]: 194/216 looper letters, 841 selfloop transitions, 440 changer transitions 0/1284 dead transitions.
[2024-03-11 22:25:56,167 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 1284 transitions, 14939 flow
[2024-03-11 22:25:56,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-11 22:25:56,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-11 22:25:56,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1303 transitions.
[2024-03-11 22:25:56,170 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4021604938271605
[2024-03-11 22:25:56,170 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1303 transitions.
[2024-03-11 22:25:56,170 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1303 transitions.
[2024-03-11 22:25:56,170 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:56,170 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1303 transitions.
[2024-03-11 22:25:56,172 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 86.86666666666666) internal successors, (1303), 15 states have internal predecessors, (1303), 0 states have call successors, (0), 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:25:56,174 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 216.0) internal successors, (3456), 16 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:25:56,175 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 216.0) internal successors, (3456), 16 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:25:56,175 INFO  L175             Difference]: Start difference. First operand has 133 places, 653 transitions, 6935 flow. Second operand 15 states and 1303 transitions.
[2024-03-11 22:25:56,175 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 1284 transitions, 14939 flow
[2024-03-11 22:25:57,504 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 1284 transitions, 14892 flow, removed 22 selfloop flow, removed 1 redundant places.
[2024-03-11 22:25:57,517 INFO  L231             Difference]: Finished difference. Result has 152 places, 882 transitions, 11230 flow
[2024-03-11 22:25:57,517 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=6889, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=11230, PETRI_PLACES=152, PETRI_TRANSITIONS=882}
[2024-03-11 22:25:57,518 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 81 predicate places.
[2024-03-11 22:25:57,518 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 882 transitions, 11230 flow
[2024-03-11 22:25:57,518 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 69.5925925925926) internal successors, (1879), 27 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:57,518 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:57,518 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:25:57,525 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:25:57,719 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,SelfDestructingSolverStorable16
[2024-03-11 22:25:57,720 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:57,720 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:57,721 INFO  L85        PathProgramCache]: Analyzing trace with hash -1128179185, now seen corresponding path program 1 times
[2024-03-11 22:25:57,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:57,721 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778544276]
[2024-03-11 22:25:57,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:57,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:57,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:57,795 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:25:57,795 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:57,795 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778544276]
[2024-03-11 22:25:57,795 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778544276] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:57,795 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346252176]
[2024-03-11 22:25:57,795 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:57,795 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:57,796 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:57,796 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:25:57,810 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:25:57,955 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:57,956 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-11 22:25:57,958 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:58,006 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:25:58,007 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:58,048 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:25:58,049 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [346252176] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:58,049 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:58,049 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-03-11 22:25:58,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007127378]
[2024-03-11 22:25:58,049 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:58,050 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-11 22:25:58,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:58,051 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-11 22:25:58,051 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-11 22:25:58,163 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 216
[2024-03-11 22:25:58,164 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 882 transitions, 11230 flow. Second operand  has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 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:25:58,164 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:58,164 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 216
[2024-03-11 22:25:58,164 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:59,251 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([579] L1017-7-->threadEXIT: Formula: (let ((.cse0 (select |v_#race_207| v_threadThread2of2ForFork0_~t~0.base_31))) (and (= |v_threadThread2of2ForFork0_#t~nondet4_30| (select .cse0 v_threadThread2of2ForFork0_~t~0.offset_31)) (= (select .cse0 (+ 3 v_threadThread2of2ForFork0_~t~0.offset_31)) |v_threadThread2of2ForFork0_#t~nondet4_30|) (= (select .cse0 (+ 2 v_threadThread2of2ForFork0_~t~0.offset_31)) |v_threadThread2of2ForFork0_#t~nondet4_30|) (= |v_threadThread2of2ForFork0_#res.base_9| 0) (= |v_threadThread2of2ForFork0_#res.offset_9| 0) (= |v_threadThread2of2ForFork0_#t~nondet4_30| (select .cse0 (+ v_threadThread2of2ForFork0_~t~0.offset_31 1)))))  InVars {#race=|v_#race_207|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_31, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_30|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_31}  OutVars{#race=|v_#race_207|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_31, threadThread2of2ForFork0_#res.offset=|v_threadThread2of2ForFork0_#res.offset_9|, threadThread2of2ForFork0_#t~nondet3=|v_threadThread2of2ForFork0_#t~nondet3_17|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_31, threadThread2of2ForFork0_#res.base=|v_threadThread2of2ForFork0_#res.base_9|}  AuxVars[]  AssignedVars[threadThread2of2ForFork0_#res.offset, threadThread2of2ForFork0_#t~nondet4, threadThread2of2ForFork0_#t~nondet3, threadThread2of2ForFork0_#res.base][274], [Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), Black: 378#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 361#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 359#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 373#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 363#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 197#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 381#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), threadThread1of2ForFork0InUse, Black: 357#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 367#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1040 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1040) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 371#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), threadThread2of2ForFork0InUse, 365#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 579#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 587#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 581#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 589#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), 585#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 591#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 46#threadEXITtrue, 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L1029-1true, 6#threadEXITtrue, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 762#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 163#true, Black: 369#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2024-03-11 22:25:59,253 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2024-03-11 22:25:59,253 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2024-03-11 22:25:59,254 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2024-03-11 22:25:59,254 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2024-03-11 22:26:00,356 INFO  L130       PetriNetUnfolder]: 5566/11804 cut-off events.
[2024-03-11 22:26:00,357 INFO  L131       PetriNetUnfolder]: For 53029/56339 co-relation queries the response was YES.
[2024-03-11 22:26:00,393 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57154 conditions, 11804 events. 5566/11804 cut-off events. For 53029/56339 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 95484 event pairs, 440 based on Foata normal form. 568/11938 useless extension candidates. Maximal degree in co-relation 54763. Up to 5031 conditions per place. 
[2024-03-11 22:26:00,431 INFO  L137   encePairwiseOnDemand]: 209/216 looper letters, 145 selfloop transitions, 7 changer transitions 18/812 dead transitions.
[2024-03-11 22:26:00,431 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 812 transitions, 10416 flow
[2024-03-11 22:26:00,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-11 22:26:00,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-11 22:26:00,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions.
[2024-03-11 22:26:00,433 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5906084656084656
[2024-03-11 22:26:00,433 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 893 transitions.
[2024-03-11 22:26:00,433 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions.
[2024-03-11 22:26:00,433 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:26:00,434 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions.
[2024-03-11 22:26:00,434 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:00,435 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 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:26:00,436 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 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:26:00,436 INFO  L175             Difference]: Start difference. First operand has 152 places, 882 transitions, 11230 flow. Second operand 7 states and 893 transitions.
[2024-03-11 22:26:00,436 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 812 transitions, 10416 flow
[2024-03-11 22:26:00,690 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 812 transitions, 10380 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-11 22:26:00,699 INFO  L231             Difference]: Finished difference. Result has 155 places, 758 transitions, 9477 flow
[2024-03-11 22:26:00,699 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=9639, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9477, PETRI_PLACES=155, PETRI_TRANSITIONS=758}
[2024-03-11 22:26:00,700 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 84 predicate places.
[2024-03-11 22:26:00,700 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 758 transitions, 9477 flow
[2024-03-11 22:26:00,700 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 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:26:00,700 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:26:00,700 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:26:00,706 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:26:00,904 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,SelfDestructingSolverStorable17
[2024-03-11 22:26:00,905 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:26:00,906 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:26:00,906 INFO  L85        PathProgramCache]: Analyzing trace with hash 1017842273, now seen corresponding path program 1 times
[2024-03-11 22:26:00,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:26:00,906 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426024726]
[2024-03-11 22:26:00,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:00,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:26:00,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:01,165 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:26:01,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:26:01,166 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426024726]
[2024-03-11 22:26:01,166 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426024726] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:26:01,166 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192895436]
[2024-03-11 22:26:01,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:01,166 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:01,167 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:26:01,167 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:26:01,169 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:26:01,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:01,309 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-11 22:26:01,312 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:26:01,338 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:26:01,406 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:26:01,444 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:26:01,473 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:01,473 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:26:01,509 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:01,509 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:26:01,570 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:01,570 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:26:01,581 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:26:01,581 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:26:01,601 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1370 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:26:01,648 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_1370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2024-03-11 22:26:01,674 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1370 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-11 22:26:01,760 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:26:01,760 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192895436] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:26:01,761 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:26:01,761 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-03-11 22:26:01,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316116379]
[2024-03-11 22:26:01,761 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:26:01,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:26:01,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:26:01,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:26:01,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2024-03-11 22:26:01,842 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 216
[2024-03-11 22:26:01,843 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 758 transitions, 9477 flow. Second operand  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:01,843 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:26:01,843 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 216
[2024-03-11 22:26:01,843 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:26:11,462 INFO  L130       PetriNetUnfolder]: 17648/29476 cut-off events.
[2024-03-11 22:26:11,462 INFO  L131       PetriNetUnfolder]: For 136524/136524 co-relation queries the response was YES.
[2024-03-11 22:26:11,693 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 153472 conditions, 29476 events. 17648/29476 cut-off events. For 136524/136524 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 211178 event pairs, 2509 based on Foata normal form. 0/27280 useless extension candidates. Maximal degree in co-relation 135862. Up to 19113 conditions per place. 
[2024-03-11 22:26:11,823 INFO  L137   encePairwiseOnDemand]: 152/216 looper letters, 804 selfloop transitions, 731 changer transitions 8/1546 dead transitions.
[2024-03-11 22:26:11,823 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 1546 transitions, 19298 flow
[2024-03-11 22:26:11,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-11 22:26:11,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-11 22:26:11,826 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1772 transitions.
[2024-03-11 22:26:11,826 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4101851851851852
[2024-03-11 22:26:11,826 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1772 transitions.
[2024-03-11 22:26:11,826 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1772 transitions.
[2024-03-11 22:26:11,827 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:26:11,827 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1772 transitions.
[2024-03-11 22:26:11,829 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 88.6) internal successors, (1772), 20 states have internal predecessors, (1772), 0 states have call successors, (0), 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:26:11,832 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 216.0) internal successors, (4536), 21 states have internal predecessors, (4536), 0 states have call successors, (0), 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:26:11,832 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 216.0) internal successors, (4536), 21 states have internal predecessors, (4536), 0 states have call successors, (0), 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:26:11,832 INFO  L175             Difference]: Start difference. First operand has 155 places, 758 transitions, 9477 flow. Second operand 20 states and 1772 transitions.
[2024-03-11 22:26:11,833 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 1546 transitions, 19298 flow
[2024-03-11 22:26:13,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1546 transitions, 18858 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-03-11 22:26:13,322 INFO  L231             Difference]: Finished difference. Result has 174 places, 1257 transitions, 17009 flow
[2024-03-11 22:26:13,322 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=9114, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=306, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=17009, PETRI_PLACES=174, PETRI_TRANSITIONS=1257}
[2024-03-11 22:26:13,323 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 103 predicate places.
[2024-03-11 22:26:13,323 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 1257 transitions, 17009 flow
[2024-03-11 22:26:13,323 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:13,323 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:26:13,324 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:26:13,331 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:26:13,524 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:13,525 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:26:13,526 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:26:13,526 INFO  L85        PathProgramCache]: Analyzing trace with hash 1439509017, now seen corresponding path program 1 times
[2024-03-11 22:26:13,526 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:26:13,526 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854087523]
[2024-03-11 22:26:13,526 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:13,527 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:26:13,548 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:13,821 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:26:13,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:26:13,821 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854087523]
[2024-03-11 22:26:13,822 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854087523] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:26:13,822 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027236795]
[2024-03-11 22:26:13,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:13,822 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:13,822 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:26:13,823 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:26:13,833 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:26:13,976 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:13,979 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-03-11 22:26:13,982 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:26:14,007 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:26:14,101 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:26:14,140 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:14,141 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:26:14,183 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:14,184 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:14,186 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:26:14,238 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:14,239 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:14,240 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:14,241 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:26:14,340 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:14,341 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:26:14,379 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:26:14,380 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:26:14,413 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-11 22:26:14,476 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false
[2024-03-11 22:26:14,522 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))))) is different from false
[2024-03-11 22:26:14,554 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))))) is different from false
[2024-03-11 22:26:14,592 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3 0) .cse1 0) .cse2 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_39 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_39) (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_39 v_ArrVal_1483) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))))) is different from false
[2024-03-11 22:26:14,623 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:14,623 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-11 22:26:14,631 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:14,631 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2024-03-11 22:26:14,637 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-11 22:26:14,649 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:26:14,649 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:26:14,657 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:26:14,657 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:26:14,662 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:26:14,663 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-11 22:26:14,719 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:26:14,719 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027236795] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:26:14,719 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:26:14,720 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2024-03-11 22:26:14,720 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012338350]
[2024-03-11 22:26:14,720 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:26:14,720 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-03-11 22:26:14,720 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:26:14,721 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-03-11 22:26:14,721 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=455, Unknown=5, NotChecked=240, Total=812
[2024-03-11 22:26:14,856 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 216
[2024-03-11 22:26:14,858 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 1257 transitions, 17009 flow. Second operand  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:14,858 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:26:14,858 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 216
[2024-03-11 22:26:14,858 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:26:25,080 INFO  L130       PetriNetUnfolder]: 19994/34001 cut-off events.
[2024-03-11 22:26:25,081 INFO  L131       PetriNetUnfolder]: For 236697/236707 co-relation queries the response was YES.
[2024-03-11 22:26:25,272 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 229735 conditions, 34001 events. 19994/34001 cut-off events. For 236697/236707 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 252372 event pairs, 2175 based on Foata normal form. 244/32463 useless extension candidates. Maximal degree in co-relation 198364. Up to 17996 conditions per place. 
[2024-03-11 22:26:25,419 INFO  L137   encePairwiseOnDemand]: 183/216 looper letters, 1279 selfloop transitions, 614 changer transitions 6/1902 dead transitions.
[2024-03-11 22:26:25,419 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1902 transitions, 28445 flow
[2024-03-11 22:26:25,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-03-11 22:26:25,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-03-11 22:26:25,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1154 transitions.
[2024-03-11 22:26:25,421 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3816137566137566
[2024-03-11 22:26:25,421 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1154 transitions.
[2024-03-11 22:26:25,422 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1154 transitions.
[2024-03-11 22:26:25,422 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:26:25,422 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1154 transitions.
[2024-03-11 22:26:25,423 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 82.42857142857143) internal successors, (1154), 14 states have internal predecessors, (1154), 0 states have call successors, (0), 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:26:25,425 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 216.0) internal successors, (3240), 15 states have internal predecessors, (3240), 0 states have call successors, (0), 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:26:25,426 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 216.0) internal successors, (3240), 15 states have internal predecessors, (3240), 0 states have call successors, (0), 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:26:25,426 INFO  L175             Difference]: Start difference. First operand has 174 places, 1257 transitions, 17009 flow. Second operand 14 states and 1154 transitions.
[2024-03-11 22:26:25,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 1902 transitions, 28445 flow
[2024-03-11 22:26:29,639 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 1902 transitions, 27768 flow, removed 312 selfloop flow, removed 9 redundant places.
[2024-03-11 22:26:29,663 INFO  L231             Difference]: Finished difference. Result has 185 places, 1493 transitions, 22688 flow
[2024-03-11 22:26:29,664 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=16535, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=378, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=22688, PETRI_PLACES=185, PETRI_TRANSITIONS=1493}
[2024-03-11 22:26:29,664 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 114 predicate places.
[2024-03-11 22:26:29,664 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 1493 transitions, 22688 flow
[2024-03-11 22:26:29,665 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 66.65517241379311) internal successors, (1933), 29 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:29,665 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:26:29,665 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:26:29,671 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-03-11 22:26:29,865 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:29,866 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:26:29,867 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:26:29,867 INFO  L85        PathProgramCache]: Analyzing trace with hash -445281091, now seen corresponding path program 1 times
[2024-03-11 22:26:29,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:26:29,868 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156904802]
[2024-03-11 22:26:29,868 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:29,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:26:29,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:30,036 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:26:30,036 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:26:30,036 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156904802]
[2024-03-11 22:26:30,036 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156904802] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:26:30,036 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:26:30,037 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:26:30,037 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970102371]
[2024-03-11 22:26:30,037 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:26:30,037 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:26:30,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:26:30,038 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:26:30,038 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:26:30,379 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 216
[2024-03-11 22:26:30,380 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 1493 transitions, 22688 flow. Second operand  has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 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:26:30,380 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:26:30,380 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 216
[2024-03-11 22:26:30,380 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:26:35,650 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L1017-2-->L1017-4: Formula: (= |v_#race_187| (store |v_#race_188| v_threadThread2of2ForFork0_~t~0.base_19 (store (select |v_#race_188| v_threadThread2of2ForFork0_~t~0.base_19) v_threadThread2of2ForFork0_~t~0.offset_19 |v_threadThread2of2ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_188|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  OutVars{#race=|v_#race_187|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_19|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][351], [Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), Black: 378#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 361#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 359#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 373#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 363#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 381#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), threadThread1of2ForFork0InUse, Black: 357#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 367#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1040 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1040) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), threadThread2of2ForFork0InUse, Black: 371#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), 365#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 46#threadEXITtrue, 142#true, Black: 1162#(and (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1061#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 1057#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 1172#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1065#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 1069#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), 1041#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 163#true, 107#L1017-4true, 105#L1026-14true, Black: 971#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_1370 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset)))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_1370 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (forall ((v_ArrVal_1370 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))))), Black: 955#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 963#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 959#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_1370 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 579#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 965#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (forall ((v_ArrVal_1370 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |#race| threadThread1of2ForFork0_~t~0.base (store (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset) |threadThread1of2ForFork0_#t~nondet4|)) |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1370) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))))), Black: 973#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 587#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 969#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 581#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), 585#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 589#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 591#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), 951#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), 1192#true, 760#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), Black: 762#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), Black: 369#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2024-03-11 22:26:35,650 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2024-03-11 22:26:35,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 22:26:35,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 22:26:35,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 22:26:38,148 INFO  L130       PetriNetUnfolder]: 16766/30799 cut-off events.
[2024-03-11 22:26:38,149 INFO  L131       PetriNetUnfolder]: For 295335/300567 co-relation queries the response was YES.
[2024-03-11 22:26:38,327 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 210934 conditions, 30799 events. 16766/30799 cut-off events. For 295335/300567 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 252985 event pairs, 2663 based on Foata normal form. 720/30648 useless extension candidates. Maximal degree in co-relation 176718. Up to 18683 conditions per place. 
[2024-03-11 22:26:38,469 INFO  L137   encePairwiseOnDemand]: 201/216 looper letters, 1116 selfloop transitions, 207 changer transitions 1/1708 dead transitions.
[2024-03-11 22:26:38,470 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 1708 transitions, 28762 flow
[2024-03-11 22:26:38,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:26:38,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:26:38,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions.
[2024-03-11 22:26:38,471 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.591820987654321
[2024-03-11 22:26:38,472 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 767 transitions.
[2024-03-11 22:26:38,472 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions.
[2024-03-11 22:26:38,472 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:26:38,472 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions.
[2024-03-11 22:26:38,473 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:38,474 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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:26:38,474 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 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:26:38,475 INFO  L175             Difference]: Start difference. First operand has 185 places, 1493 transitions, 22688 flow. Second operand 6 states and 767 transitions.
[2024-03-11 22:26:38,475 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 1708 transitions, 28762 flow
[2024-03-11 22:26:42,217 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 1708 transitions, 28718 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-03-11 22:26:42,241 INFO  L231             Difference]: Finished difference. Result has 189 places, 1680 transitions, 26781 flow
[2024-03-11 22:26:42,242 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=22644, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=26781, PETRI_PLACES=189, PETRI_TRANSITIONS=1680}
[2024-03-11 22:26:42,242 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 118 predicate places.
[2024-03-11 22:26:42,242 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 1680 transitions, 26781 flow
[2024-03-11 22:26:42,243 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 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:26:42,243 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:26:42,243 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:26:42,243 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-03-11 22:26:42,243 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:26:42,243 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:26:42,243 INFO  L85        PathProgramCache]: Analyzing trace with hash 1219863209, now seen corresponding path program 2 times
[2024-03-11 22:26:42,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:26:42,244 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236420247]
[2024-03-11 22:26:42,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:42,244 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:26:42,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:42,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:42,649 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:26:42,650 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236420247]
[2024-03-11 22:26:42,650 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236420247] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:26:42,650 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311340256]
[2024-03-11 22:26:42,651 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:26:42,651 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:42,651 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:26:42,653 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:26:42,654 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:26:42,858 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:26:42,859 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:26:42,861 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 59 conjunts are in the unsatisfiable core
[2024-03-11 22:26:42,867 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:26:42,887 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:42,892 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 80 treesize of output 74
[2024-03-11 22:26:42,939 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:26:42,947 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:26:43,133 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:26:43,179 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:43,181 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:26:43,218 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:43,219 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:43,219 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:26:43,268 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:43,269 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:43,270 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:43,270 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:26:43,346 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:26:43,365 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:26:43,384 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:26:43,407 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:43,408 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:43,409 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:43,410 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 48 treesize of output 56
[2024-03-11 22:26:43,587 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:43,600 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2024-03-11 22:26:43,601 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 66
[2024-03-11 22:26:43,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:43,687 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:26:43,709 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1672 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1672) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1672 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1672) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1672 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1672) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1672 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1672) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-11 22:26:43,933 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:43,933 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 102 treesize of output 102
[2024-03-11 22:26:43,996 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_prenex_3 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_prenex_3) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (forall ((v_prenex_1 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_prenex_1) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (not (= (select v_arrayElimArr_6 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (forall ((v_prenex_2 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_prenex_2) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (not (= (select v_arrayElimArr_6 .cse2) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_1672 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1672) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)))))) is different from false
[2024-03-11 22:26:44,156 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (forall ((v_prenex_2 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_prenex_2) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (not (= (select v_arrayElimArr_6 .cse3) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (forall ((v_ArrVal_1672 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1672) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (not (= (select v_arrayElimArr_6 .cse3) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_prenex_3 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_prenex_3) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (not (= (select v_arrayElimArr_6 .cse3) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (select v_arrayElimArr_6 .cse1) 0)) (forall ((v_prenex_1 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_prenex_1) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (not (= (select v_arrayElimArr_6 .cse3) 0))))))) is different from false
[2024-03-11 22:26:44,217 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1))) (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_prenex_2) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse4) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse3) 0)) (forall ((v_prenex_3 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_prenex_3) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (not (= (select v_arrayElimArr_6 .cse4) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse3) 0)) (forall ((v_prenex_1 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_prenex_1) c_threadThread1of2ForFork0_~t~0.base) .cse5))) (not (= (select v_arrayElimArr_6 .cse4) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int))) (or (forall ((v_ArrVal_1672 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1672) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (not (= (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (not (= (select v_arrayElimArr_6 .cse2) 0)) (not (= (select v_arrayElimArr_6 .cse3) 0)) (not (= (select v_arrayElimArr_6 .cse4) 0))))))) is different from false
[2024-03-11 22:26:44,511 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:44,512 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54
[2024-03-11 22:26:44,519 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:44,519 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 118 treesize of output 66
[2024-03-11 22:26:44,546 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:44,547 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 79
[2024-03-11 22:26:44,553 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34
[2024-03-11 22:26:44,651 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:26:44,651 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1
[2024-03-11 22:26:44,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked.
[2024-03-11 22:26:44,707 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311340256] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:26:44,707 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:26:44,707 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 29
[2024-03-11 22:26:44,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29721916]
[2024-03-11 22:26:44,708 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:26:44,708 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 31 states
[2024-03-11 22:26:44,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:26:44,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants.
[2024-03-11 22:26:44,709 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=574, Unknown=5, NotChecked=212, Total=930
[2024-03-11 22:26:44,896 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 216
[2024-03-11 22:26:44,897 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 1680 transitions, 26781 flow. Second operand  has 31 states, 31 states have (on average 59.774193548387096) internal successors, (1853), 31 states have internal predecessors, (1853), 0 states have call successors, (0), 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:26:44,898 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:26:44,898 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 216
[2024-03-11 22:26:44,898 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:27:04,904 INFO  L130       PetriNetUnfolder]: 22421/38203 cut-off events.
[2024-03-11 22:27:04,904 INFO  L131       PetriNetUnfolder]: For 372474/372487 co-relation queries the response was YES.
[2024-03-11 22:27:05,129 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 282371 conditions, 38203 events. 22421/38203 cut-off events. For 372474/372487 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 290992 event pairs, 2292 based on Foata normal form. 386/36981 useless extension candidates. Maximal degree in co-relation 247495. Up to 21166 conditions per place. 
[2024-03-11 22:27:05,295 INFO  L137   encePairwiseOnDemand]: 152/216 looper letters, 1133 selfloop transitions, 1447 changer transitions 48/2632 dead transitions.
[2024-03-11 22:27:05,295 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 2632 transitions, 44417 flow
[2024-03-11 22:27:05,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-03-11 22:27:05,296 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-03-11 22:27:05,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1769 transitions.
[2024-03-11 22:27:05,297 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.37226430976430974
[2024-03-11 22:27:05,297 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1769 transitions.
[2024-03-11 22:27:05,297 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1769 transitions.
[2024-03-11 22:27:05,298 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:27:05,298 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1769 transitions.
[2024-03-11 22:27:05,300 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 80.4090909090909) internal successors, (1769), 22 states have internal predecessors, (1769), 0 states have call successors, (0), 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:27:05,303 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 216.0) internal successors, (4968), 23 states have internal predecessors, (4968), 0 states have call successors, (0), 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:27:05,303 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 216.0) internal successors, (4968), 23 states have internal predecessors, (4968), 0 states have call successors, (0), 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:27:05,303 INFO  L175             Difference]: Start difference. First operand has 189 places, 1680 transitions, 26781 flow. Second operand 22 states and 1769 transitions.
[2024-03-11 22:27:05,303 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 2632 transitions, 44417 flow
[2024-03-11 22:27:12,140 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 2632 transitions, 44123 flow, removed 147 selfloop flow, removed 0 redundant places.
[2024-03-11 22:27:12,176 INFO  L231             Difference]: Finished difference. Result has 219 places, 2166 transitions, 39285 flow
[2024-03-11 22:27:12,177 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=26493, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1005, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=39285, PETRI_PLACES=219, PETRI_TRANSITIONS=2166}
[2024-03-11 22:27:12,177 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 148 predicate places.
[2024-03-11 22:27:12,177 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 2166 transitions, 39285 flow
[2024-03-11 22:27:12,177 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 31 states, 31 states have (on average 59.774193548387096) internal successors, (1853), 31 states have internal predecessors, (1853), 0 states have call successors, (0), 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:27:12,178 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:27:12,178 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:27:12,183 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2024-03-11 22:27:12,379 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:27:12,379 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:27:12,380 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:27:12,380 INFO  L85        PathProgramCache]: Analyzing trace with hash -865058449, now seen corresponding path program 1 times
[2024-03-11 22:27:12,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:27:12,381 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660762282]
[2024-03-11 22:27:12,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:27:12,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:27:12,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:27:12,759 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:27:12,759 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:27:12,759 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660762282]
[2024-03-11 22:27:12,759 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660762282] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:27:12,759 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656294906]
[2024-03-11 22:27:12,759 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:27:12,760 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:27:12,760 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:27:12,761 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:27:12,762 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:27:12,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:27:12,938 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-11 22:27:12,944 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:27:12,952 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 216 treesize of output 192
[2024-03-11 22:27:13,218 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-03-11 22:27:13,219 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 51
[2024-03-11 22:27:13,233 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 16 treesize of output 12
[2024-03-11 22:27:13,286 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:27:13,302 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:27:13,308 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:27:13,321 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:27:13,321 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:27:13,336 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:27:13,337 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:27:13,354 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:27:13,361 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:27:13,361 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:27:13,379 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1805 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1805 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1805 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1805 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-03-11 22:27:13,400 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_1805 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1805 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1805 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1805 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-11 22:27:13,420 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_1805 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1805 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1805 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1805 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1805) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-11 22:27:13,532 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1796 (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_1796) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2024-03-11 22:27:13,570 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:27:13,570 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [656294906] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:27:13,571 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:27:13,571 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24
[2024-03-11 22:27:13,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570091677]
[2024-03-11 22:27:13,571 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:27:13,572 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:27:13,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:27:13,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:27:13,573 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=388, Unknown=8, NotChecked=172, Total=650
[2024-03-11 22:27:13,656 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 216
[2024-03-11 22:27:13,657 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 2166 transitions, 39285 flow. Second operand  has 26 states, 26 states have (on average 61.65384615384615) internal successors, (1603), 26 states have internal predecessors, (1603), 0 states have call successors, (0), 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:27:13,657 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:27:13,657 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 216
[2024-03-11 22:27:13,657 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:27:37,136 INFO  L130       PetriNetUnfolder]: 30838/51727 cut-off events.
[2024-03-11 22:27:37,136 INFO  L131       PetriNetUnfolder]: For 788933/788933 co-relation queries the response was YES.
[2024-03-11 22:27:37,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 455846 conditions, 51727 events. 30838/51727 cut-off events. For 788933/788933 co-relation queries the response was YES. Maximal size of possible extension queue 1394. Compared 406373 event pairs, 5635 based on Foata normal form. 262/51754 useless extension candidates. Maximal degree in co-relation 429768. Up to 39349 conditions per place. 
[2024-03-11 22:27:37,840 INFO  L137   encePairwiseOnDemand]: 180/216 looper letters, 2783 selfloop transitions, 564 changer transitions 5/3353 dead transitions.
[2024-03-11 22:27:37,841 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 3353 transitions, 66849 flow
[2024-03-11 22:27:37,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-11 22:27:37,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-11 22:27:37,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1376 transitions.
[2024-03-11 22:27:37,843 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35390946502057613
[2024-03-11 22:27:37,843 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1376 transitions.
[2024-03-11 22:27:37,843 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1376 transitions.
[2024-03-11 22:27:37,844 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:27:37,844 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1376 transitions.
[2024-03-11 22:27:37,846 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 76.44444444444444) internal successors, (1376), 18 states have internal predecessors, (1376), 0 states have call successors, (0), 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:27:37,848 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 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:27:37,849 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 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:27:37,849 INFO  L175             Difference]: Start difference. First operand has 219 places, 2166 transitions, 39285 flow. Second operand 18 states and 1376 transitions.
[2024-03-11 22:27:37,849 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 3353 transitions, 66849 flow
[2024-03-11 22:27:54,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 3353 transitions, 66056 flow, removed 354 selfloop flow, removed 12 redundant places.
[2024-03-11 22:27:54,487 INFO  L231             Difference]: Finished difference. Result has 235 places, 2756 transitions, 53061 flow
[2024-03-11 22:27:54,489 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=38609, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1808, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=53061, PETRI_PLACES=235, PETRI_TRANSITIONS=2756}
[2024-03-11 22:27:54,490 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 164 predicate places.
[2024-03-11 22:27:54,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 2756 transitions, 53061 flow
[2024-03-11 22:27:54,491 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 61.65384615384615) internal successors, (1603), 26 states have internal predecessors, (1603), 0 states have call successors, (0), 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:27:54,491 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:27:54,491 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:27:54,496 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2024-03-11 22:27:54,692 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2024-03-11 22:27:54,693 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:27:54,693 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:27:54,694 INFO  L85        PathProgramCache]: Analyzing trace with hash 1592622727, now seen corresponding path program 2 times
[2024-03-11 22:27:54,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:27:54,694 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543198208]
[2024-03-11 22:27:54,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:27:54,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:27:54,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:27:55,154 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:27:55,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:27:55,155 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543198208]
[2024-03-11 22:27:55,155 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543198208] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:27:55,155 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58601077]
[2024-03-11 22:27:55,155 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:27:55,156 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:27:55,156 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:27:55,157 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:27:55,158 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-03-11 22:27:55,434 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:27:55,434 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:27:55,436 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 41 conjunts are in the unsatisfiable core
[2024-03-11 22:27:55,441 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:27:55,456 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:55,458 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:55,461 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2024-03-11 22:27:55,761 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:27:55,762 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 62
[2024-03-11 22:27:55,882 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:27:55,882 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2024-03-11 22:27:55,960 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-03-11 22:27:55,960 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40
[2024-03-11 22:27:55,973 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:27:55,979 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:27:55,990 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:27:55,990 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:27:56,002 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:27:56,003 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:27:56,021 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:27:56,029 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:27:56,029 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:27:56,044 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-11 22:27:56,065 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_1939 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1939 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:27:56,078 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1939 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1939) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-11 22:27:56,146 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1930 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1930) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-11 22:27:56,190 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2024-03-11 22:27:56,206 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (not (= (select (select (store (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_1929) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false
[2024-03-11 22:27:56,220 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (= (select (select (store (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_1929) .cse0 v_ArrVal_1930) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) .cse0)))) is different from false
[2024-03-11 22:27:56,221 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:27:56,221 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [58601077] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:27:56,221 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:27:56,221 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 26
[2024-03-11 22:27:56,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986312191]
[2024-03-11 22:27:56,222 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:27:56,222 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2024-03-11 22:27:56,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:27:56,223 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-03-11 22:27:56,223 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=352, Unknown=12, NotChecked=308, Total=756
[2024-03-11 22:27:56,224 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 216
[2024-03-11 22:27:56,225 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 2756 transitions, 53061 flow. Second operand  has 28 states, 28 states have (on average 61.714285714285715) internal successors, (1728), 28 states have internal predecessors, (1728), 0 states have call successors, (0), 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:27:56,225 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:27:56,225 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 216
[2024-03-11 22:27:56,225 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:28:33,519 INFO  L130       PetriNetUnfolder]: 37868/63070 cut-off events.
[2024-03-11 22:28:33,520 INFO  L131       PetriNetUnfolder]: For 1205689/1205689 co-relation queries the response was YES.
[2024-03-11 22:28:34,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 598532 conditions, 63070 events. 37868/63070 cut-off events. For 1205689/1205689 co-relation queries the response was YES. Maximal size of possible extension queue 1602. Compared 499311 event pairs, 6213 based on Foata normal form. 72/62907 useless extension candidates. Maximal degree in co-relation 581895. Up to 50938 conditions per place. 
[2024-03-11 22:28:34,452 INFO  L137   encePairwiseOnDemand]: 184/216 looper letters, 4580 selfloop transitions, 673 changer transitions 0/5254 dead transitions.
[2024-03-11 22:28:34,452 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 5254 transitions, 103666 flow
[2024-03-11 22:28:34,453 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-03-11 22:28:34,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-03-11 22:28:34,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2339 transitions.
[2024-03-11 22:28:34,456 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3493130227001195
[2024-03-11 22:28:34,457 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2339 transitions.
[2024-03-11 22:28:34,457 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2339 transitions.
[2024-03-11 22:28:34,458 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:28:34,458 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2339 transitions.
[2024-03-11 22:28:34,460 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 75.45161290322581) internal successors, (2339), 31 states have internal predecessors, (2339), 0 states have call successors, (0), 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:28:34,464 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 216.0) internal successors, (6912), 32 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:28:34,465 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 216.0) internal successors, (6912), 32 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:28:34,465 INFO  L175             Difference]: Start difference. First operand has 235 places, 2756 transitions, 53061 flow. Second operand 31 states and 2339 transitions.
[2024-03-11 22:28:34,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 5254 transitions, 103666 flow
[2024-03-11 22:29:05,727 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 5254 transitions, 102654 flow, removed 504 selfloop flow, removed 2 redundant places.
[2024-03-11 22:29:05,798 INFO  L231             Difference]: Finished difference. Result has 284 places, 3426 transitions, 67776 flow
[2024-03-11 22:29:05,800 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=52179, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=67776, PETRI_PLACES=284, PETRI_TRANSITIONS=3426}
[2024-03-11 22:29:05,800 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 213 predicate places.
[2024-03-11 22:29:05,801 INFO  L495      AbstractCegarLoop]: Abstraction has has 284 places, 3426 transitions, 67776 flow
[2024-03-11 22:29:05,801 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 61.714285714285715) internal successors, (1728), 28 states have internal predecessors, (1728), 0 states have call successors, (0), 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:29:05,801 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:29:05,801 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:29:05,809 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2024-03-11 22:29:06,002 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2024-03-11 22:29:06,003 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:29:06,003 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:29:06,004 INFO  L85        PathProgramCache]: Analyzing trace with hash 806310015, now seen corresponding path program 3 times
[2024-03-11 22:29:06,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:29:06,004 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150901683]
[2024-03-11 22:29:06,005 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:29:06,005 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:29:06,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:29:06,565 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:29:06,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:29:06,566 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150901683]
[2024-03-11 22:29:06,566 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150901683] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:29:06,566 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123323236]
[2024-03-11 22:29:06,566 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-11 22:29:06,566 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:29:06,567 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:29:06,568 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:29:06,569 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-03-11 22:29:06,753 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-11 22:29:06,753 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:29:06,754 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 72 conjunts are in the unsatisfiable core
[2024-03-11 22:29:06,762 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:29:06,787 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:06,790 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:06,793 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2024-03-11 22:29:07,417 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:29:07,417 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:29:07,426 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:07,427 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:07,431 INFO  L321             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-03-11 22:29:07,431 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31
[2024-03-11 22:29:07,581 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:29:07,581 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2024-03-11 22:29:07,588 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:07,589 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:07,593 INFO  L321             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-03-11 22:29:07,594 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31
[2024-03-11 22:29:07,712 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:29:08,020 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:29:08,147 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:08,147 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:29:08,294 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:08,294 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:29:08,439 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-03-11 22:29:08,440 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40
[2024-03-11 22:29:08,456 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-11 22:29:08,456 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 29 treesize of output 13
[2024-03-11 22:29:08,546 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:08,546 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:29:08,584 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:08,584 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:29:08,616 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:08,617 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:29:08,647 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:08,648 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:29:08,797 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:08,799 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:08,800 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:08,801 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:08,802 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:08,803 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64
[2024-03-11 22:29:08,868 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:29:08,869 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:29:14,709 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:14,710 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 81 treesize of output 74
[2024-03-11 22:29:14,728 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:14,729 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 548 treesize of output 484
[2024-03-11 22:29:14,747 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:14,748 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 532 treesize of output 508
[2024-03-11 22:29:14,770 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 290 treesize of output 274
[2024-03-11 22:29:15,229 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:15,229 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 331 treesize of output 249
[2024-03-11 22:29:15,305 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:15,306 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2024-03-11 22:29:15,314 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:29:15,329 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-11 22:29:15,330 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 144 treesize of output 126
[2024-03-11 22:29:15,357 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:15,357 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 63 treesize of output 67
[2024-03-11 22:29:15,370 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 132 treesize of output 98
[2024-03-11 22:29:15,432 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:15,433 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 72
[2024-03-11 22:29:15,441 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:29:15,457 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-11 22:29:15,458 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 168 treesize of output 142
[2024-03-11 22:29:15,488 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:15,489 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 76 treesize of output 80
[2024-03-11 22:29:15,502 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 120
[2024-03-11 22:29:15,578 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:15,579 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2024-03-11 22:29:15,587 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:29:15,605 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-03-11 22:29:15,606 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 164 treesize of output 138
[2024-03-11 22:29:15,635 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:15,636 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 82
[2024-03-11 22:29:15,650 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 170 treesize of output 128
[2024-03-11 22:29:39,426 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:29:39,427 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123323236] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:29:39,427 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:29:39,427 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 15] total 41
[2024-03-11 22:29:39,428 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752866984]
[2024-03-11 22:29:39,428 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:29:39,428 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 43 states
[2024-03-11 22:29:39,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:29:39,429 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2024-03-11 22:29:39,430 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1558, Unknown=28, NotChecked=0, Total=1806
[2024-03-11 22:29:56,877 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 216
[2024-03-11 22:29:56,879 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 3426 transitions, 67776 flow. Second operand  has 43 states, 43 states have (on average 47.2093023255814) internal successors, (2030), 43 states have internal predecessors, (2030), 0 states have call successors, (0), 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:29:56,879 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:29:56,880 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 216
[2024-03-11 22:29:56,880 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:31:52,484 INFO  L130       PetriNetUnfolder]: 38586/64351 cut-off events.
[2024-03-11 22:31:52,484 INFO  L131       PetriNetUnfolder]: For 1599761/1599761 co-relation queries the response was YES.
[2024-03-11 22:31:53,290 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 669244 conditions, 64351 events. 38586/64351 cut-off events. For 1599761/1599761 co-relation queries the response was YES. Maximal size of possible extension queue 1627. Compared 512246 event pairs, 4883 based on Foata normal form. 45/64149 useless extension candidates. Maximal degree in co-relation 652377. Up to 54185 conditions per place. 
[2024-03-11 22:31:53,675 INFO  L137   encePairwiseOnDemand]: 168/216 looper letters, 4594 selfloop transitions, 1116 changer transitions 118/5829 dead transitions.
[2024-03-11 22:31:53,676 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 5829 transitions, 120060 flow
[2024-03-11 22:31:53,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. 
[2024-03-11 22:31:53,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2024-03-11 22:31:53,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 3898 transitions.
[2024-03-11 22:31:53,681 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2693477059148701
[2024-03-11 22:31:53,681 INFO  L72            ComplementDD]: Start complementDD. Operand 67 states and 3898 transitions.
[2024-03-11 22:31:53,681 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 67 states and 3898 transitions.
[2024-03-11 22:31:53,682 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:31:53,682 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 67 states and 3898 transitions.
[2024-03-11 22:31:53,686 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 68 states, 67 states have (on average 58.17910447761194) internal successors, (3898), 67 states have internal predecessors, (3898), 0 states have call successors, (0), 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:31:53,693 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 68 states, 68 states have (on average 216.0) internal successors, (14688), 68 states have internal predecessors, (14688), 0 states have call successors, (0), 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:31:53,694 INFO  L81            ComplementDD]: Finished complementDD. Result  has 68 states, 68 states have (on average 216.0) internal successors, (14688), 68 states have internal predecessors, (14688), 0 states have call successors, (0), 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:31:53,694 INFO  L175             Difference]: Start difference. First operand has 284 places, 3426 transitions, 67776 flow. Second operand 67 states and 3898 transitions.
[2024-03-11 22:31:53,694 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 5829 transitions, 120060 flow
[2024-03-11 22:32:46,244 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 5829 transitions, 117498 flow, removed 1249 selfloop flow, removed 10 redundant places.
[2024-03-11 22:32:46,326 INFO  L231             Difference]: Finished difference. Result has 380 places, 4345 transitions, 88295 flow
[2024-03-11 22:32:46,328 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=66044, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=385, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2862, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=88295, PETRI_PLACES=380, PETRI_TRANSITIONS=4345}
[2024-03-11 22:32:46,329 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 309 predicate places.
[2024-03-11 22:32:46,329 INFO  L495      AbstractCegarLoop]: Abstraction has has 380 places, 4345 transitions, 88295 flow
[2024-03-11 22:32:46,329 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 43 states, 43 states have (on average 47.2093023255814) internal successors, (2030), 43 states have internal predecessors, (2030), 0 states have call successors, (0), 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:32:46,329 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:32:46,329 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:32:46,337 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2024-03-11 22:32:46,531 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2024-03-11 22:32:46,531 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:32:46,532 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:32:46,532 INFO  L85        PathProgramCache]: Analyzing trace with hash -1797840233, now seen corresponding path program 4 times
[2024-03-11 22:32:46,532 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:32:46,533 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812031423]
[2024-03-11 22:32:46,533 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:32:46,533 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:32:46,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:32:47,247 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:32:47,248 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:32:47,248 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812031423]
[2024-03-11 22:32:47,248 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812031423] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:32:47,248 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314144920]
[2024-03-11 22:32:47,249 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-11 22:32:47,249 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:32:47,249 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:32:47,250 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:32:47,252 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2024-03-11 22:32:47,552 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-11 22:32:47,552 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:32:47,555 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 49 conjunts are in the unsatisfiable core
[2024-03-11 22:32:47,575 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:32:47,584 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2024-03-11 22:32:47,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43
[2024-03-11 22:32:47,976 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-03-11 22:32:47,977 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 56
[2024-03-11 22:32:47,989 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2024-03-11 22:32:48,054 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:32:48,104 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:32:48,157 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-11 22:32:48,212 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:32:48,277 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:32:48,277 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:32:48,349 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:32:48,349 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:32:48,426 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:32:48,459 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:32:48,481 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:32:48,519 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:32:48,573 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:32:48,589 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:32:48,589 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:32:48,622 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2220 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2220 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2220 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2220 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-11 22:32:48,673 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:32:48,749 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:32:48,778 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2219) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2220) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-11 22:32:49,315 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:32:49,315 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2024-03-11 22:32:49,324 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:32:49,324 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 78
[2024-03-11 22:32:49,330 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 36 treesize of output 32
[2024-03-11 22:32:49,334 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 54 treesize of output 46
[2024-03-11 22:32:49,362 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:32:49,362 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:32:49,368 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:32:49,368 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:32:49,375 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:32:49,375 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:32:49,616 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:32:49,617 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [314144920] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:32:49,617 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:32:49,617 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 32
[2024-03-11 22:32:49,617 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574748744]
[2024-03-11 22:32:49,617 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:32:49,618 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2024-03-11 22:32:49,618 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:32:49,618 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2024-03-11 22:32:49,619 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=734, Unknown=27, NotChecked=236, Total=1122
[2024-03-11 22:32:50,000 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 216
[2024-03-11 22:32:50,003 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 4345 transitions, 88295 flow. Second operand  has 34 states, 34 states have (on average 61.55882352941177) internal successors, (2093), 34 states have internal predecessors, (2093), 0 states have call successors, (0), 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:32:50,003 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:32:50,004 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 216
[2024-03-11 22:32:50,004 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:33:55,164 INFO  L130       PetriNetUnfolder]: 40231/67053 cut-off events.
[2024-03-11 22:33:55,165 INFO  L131       PetriNetUnfolder]: For 1926618/1926618 co-relation queries the response was YES.
[2024-03-11 22:33:56,455 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 727574 conditions, 67053 events. 40231/67053 cut-off events. For 1926618/1926618 co-relation queries the response was YES. Maximal size of possible extension queue 1731. Compared 534918 event pairs, 6221 based on Foata normal form. 79/66885 useless extension candidates. Maximal degree in co-relation 726352. Up to 55909 conditions per place. 
[2024-03-11 22:33:56,844 INFO  L137   encePairwiseOnDemand]: 183/216 looper letters, 4906 selfloop transitions, 1014 changer transitions 44/5965 dead transitions.
[2024-03-11 22:33:56,845 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 5965 transitions, 131474 flow
[2024-03-11 22:33:56,846 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-11 22:33:56,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-11 22:33:56,848 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1966 transitions.
[2024-03-11 22:33:56,848 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35007122507122507
[2024-03-11 22:33:56,849 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1966 transitions.
[2024-03-11 22:33:56,849 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1966 transitions.
[2024-03-11 22:33:56,849 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:33:56,849 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1966 transitions.
[2024-03-11 22:33:56,851 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 75.61538461538461) internal successors, (1966), 26 states have internal predecessors, (1966), 0 states have call successors, (0), 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:33:56,854 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 216.0) internal successors, (5832), 27 states have internal predecessors, (5832), 0 states have call successors, (0), 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:33:56,854 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 216.0) internal successors, (5832), 27 states have internal predecessors, (5832), 0 states have call successors, (0), 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:33:56,854 INFO  L175             Difference]: Start difference. First operand has 380 places, 4345 transitions, 88295 flow. Second operand 26 states and 1966 transitions.
[2024-03-11 22:33:56,855 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 5965 transitions, 131474 flow
[2024-03-11 22:35:10,373 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 5965 transitions, 129326 flow, removed 1060 selfloop flow, removed 14 redundant places.
[2024-03-11 22:35:10,462 INFO  L231             Difference]: Finished difference. Result has 399 places, 4816 transitions, 101100 flow
[2024-03-11 22:35:10,465 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=86569, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=596, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=101100, PETRI_PLACES=399, PETRI_TRANSITIONS=4816}
[2024-03-11 22:35:10,466 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 328 predicate places.
[2024-03-11 22:35:10,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 399 places, 4816 transitions, 101100 flow
[2024-03-11 22:35:10,466 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 61.55882352941177) internal successors, (2093), 34 states have internal predecessors, (2093), 0 states have call successors, (0), 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:35:10,466 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:35:10,466 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:35:10,471 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2024-03-11 22:35:10,667 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2024-03-11 22:35:10,668 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:35:10,669 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:35:10,669 INFO  L85        PathProgramCache]: Analyzing trace with hash -130130061, now seen corresponding path program 5 times
[2024-03-11 22:35:10,669 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:35:10,669 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736165901]
[2024-03-11 22:35:10,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:35:10,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:35:10,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:35:11,438 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:35:11,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:35:11,439 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736165901]
[2024-03-11 22:35:11,439 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736165901] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:35:11,439 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53113628]
[2024-03-11 22:35:11,439 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-11 22:35:11,439 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:35:11,439 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:35:11,440 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:35:11,442 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2024-03-11 22:35:11,655 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:35:11,655 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:35:11,656 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core
[2024-03-11 22:35:11,664 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:35:11,675 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:11,678 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:11,681 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2024-03-11 22:35:11,781 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:35:12,319 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:35:12,319 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:35:12,461 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:35:12,461 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2024-03-11 22:35:12,661 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:35:12,753 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:12,753 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:35:12,911 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:12,912 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:12,915 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:35:12,915 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:35:13,046 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:35:13,046 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 35
[2024-03-11 22:35:13,151 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:13,153 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:13,154 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:13,155 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:35:13,257 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:13,258 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:35:13,308 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:13,308 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:35:13,340 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:13,341 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:35:13,381 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:35:13,382 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:35:13,509 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:35:13,578 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:35:13,578 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:35:13,608 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2358 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2358 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2358 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2358 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:35:13,686 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:35:13,762 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_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-11 22:35:13,794 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) .cse1 v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) .cse1 v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) .cse1 v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) .cse1 v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2024-03-11 22:35:13,820 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) .cse1 v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) .cse1 v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) .cse1 v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2357) .cse1 v_ArrVal_2358) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-11 22:35:14,126 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:35:14,127 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:35:14,135 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:35:14,135 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 134 treesize of output 82
[2024-03-11 22:35:14,142 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 36 treesize of output 32
[2024-03-11 22:35:14,146 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 54 treesize of output 46
[2024-03-11 22:35:14,182 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:35:14,182 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:35:14,190 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:35:14,190 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:35:14,198 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:35:14,199 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:35:14,570 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:35:14,571 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [53113628] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:35:14,571 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:35:14,571 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35
[2024-03-11 22:35:14,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480943355]
[2024-03-11 22:35:14,571 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:35:14,571 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2024-03-11 22:35:14,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:35:14,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2024-03-11 22:35:14,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=851, Unknown=26, NotChecked=320, Total=1332
[2024-03-11 22:35:15,341 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 216
[2024-03-11 22:35:15,342 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 4816 transitions, 101100 flow. Second operand  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 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:35:15,342 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:35:15,342 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 216
[2024-03-11 22:35:15,342 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:36:38,515 INFO  L130       PetriNetUnfolder]: 40586/67628 cut-off events.
[2024-03-11 22:36:38,516 INFO  L131       PetriNetUnfolder]: For 2164215/2164215 co-relation queries the response was YES.
[2024-03-11 22:36:39,795 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 763115 conditions, 67628 events. 40586/67628 cut-off events. For 2164215/2164215 co-relation queries the response was YES. Maximal size of possible extension queue 1714. Compared 540211 event pairs, 6118 based on Foata normal form. 41/67422 useless extension candidates. Maximal degree in co-relation 758740. Up to 56910 conditions per place. 
[2024-03-11 22:36:40,229 INFO  L137   encePairwiseOnDemand]: 180/216 looper letters, 5033 selfloop transitions, 1253 changer transitions 65/6352 dead transitions.
[2024-03-11 22:36:40,229 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 6352 transitions, 140244 flow
[2024-03-11 22:36:40,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. 
[2024-03-11 22:36:40,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2024-03-11 22:36:40,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 3598 transitions.
[2024-03-11 22:36:40,249 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.31429070580013974
[2024-03-11 22:36:40,249 INFO  L72            ComplementDD]: Start complementDD. Operand 53 states and 3598 transitions.
[2024-03-11 22:36:40,249 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 53 states and 3598 transitions.
[2024-03-11 22:36:40,251 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:36:40,252 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 3598 transitions.
[2024-03-11 22:36:40,255 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 54 states, 53 states have (on average 67.88679245283019) internal successors, (3598), 53 states have internal predecessors, (3598), 0 states have call successors, (0), 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:36:40,261 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 54 states, 54 states have (on average 216.0) internal successors, (11664), 54 states have internal predecessors, (11664), 0 states have call successors, (0), 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:36:40,262 INFO  L81            ComplementDD]: Finished complementDD. Result  has 54 states, 54 states have (on average 216.0) internal successors, (11664), 54 states have internal predecessors, (11664), 0 states have call successors, (0), 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:36:40,262 INFO  L175             Difference]: Start difference. First operand has 399 places, 4816 transitions, 101100 flow. Second operand 53 states and 3598 transitions.
[2024-03-11 22:36:40,262 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 6352 transitions, 140244 flow
[2024-03-11 22:38:01,333 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 6352 transitions, 138216 flow, removed 978 selfloop flow, removed 7 redundant places.
[2024-03-11 22:38:01,428 INFO  L231             Difference]: Finished difference. Result has 460 places, 4996 transitions, 107801 flow
[2024-03-11 22:38:01,431 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=99569, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4816, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1089, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=107801, PETRI_PLACES=460, PETRI_TRANSITIONS=4996}
[2024-03-11 22:38:01,432 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 389 predicate places.
[2024-03-11 22:38:01,432 INFO  L495      AbstractCegarLoop]: Abstraction has has 460 places, 4996 transitions, 107801 flow
[2024-03-11 22:38:01,432 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 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:01,433 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:38:01,433 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:38:01,440 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0
[2024-03-11 22:38:01,633 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2024-03-11 22:38:01,634 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:38:01,635 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:38:01,635 INFO  L85        PathProgramCache]: Analyzing trace with hash 250036919, now seen corresponding path program 6 times
[2024-03-11 22:38:01,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:38:01,636 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927589109]
[2024-03-11 22:38:01,636 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:38:01,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:38:01,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:38:02,375 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:02,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:38:02,376 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927589109]
[2024-03-11 22:38:02,376 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927589109] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:38:02,376 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137643]
[2024-03-11 22:38:02,376 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-11 22:38:02,377 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:38:02,377 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:38:02,378 INFO  L229       MonitoredProcess]: Starting monitored process 18 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:02,379 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2024-03-11 22:38:02,613 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-11 22:38:02,613 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:38:02,615 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 59 conjunts are in the unsatisfiable core
[2024-03-11 22:38:02,619 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:38:02,641 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2024-03-11 22:38:02,706 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:38:03,138 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-03-11 22:38:03,139 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 57
[2024-03-11 22:38:03,149 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2024-03-11 22:38:03,279 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:03,373 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:38:03,437 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:03,438 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:38:03,521 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:03,523 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:38:03,523 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:38:03,601 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:38:03,686 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-11 22:38:03,714 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
Killed by 15
