./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.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 ad5536c4fd6764a8366f8fc19f92d266221f7e9f3361bf9e76cf5d7ce6ce63b5
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-02-28 17:23:13,933 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 17:23:13,935 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-02-28 17:23:13,954 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-02-28 17:23:13,954 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-02-28 17:23:13,955 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-02-28 17:23:13,956 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-02-28 17:23:13,957 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-02-28 17:23:13,958 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-02-28 17:23:13,959 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-02-28 17:23:13,959 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-02-28 17:23:13,960 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-02-28 17:23:13,960 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-02-28 17:23:13,961 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-02-28 17:23:13,962 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-02-28 17:23:13,962 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-02-28 17:23:13,963 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-02-28 17:23:13,964 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-02-28 17:23:13,965 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-02-28 17:23:13,966 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-02-28 17:23:13,967 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-02-28 17:23:13,968 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-02-28 17:23:13,968 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-02-28 17:23:13,969 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-02-28 17:23:13,971 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-02-28 17:23:13,971 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-02-28 17:23:13,972 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-02-28 17:23:13,972 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-02-28 17:23:13,972 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-02-28 17:23:13,973 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-02-28 17:23:13,973 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-02-28 17:23:13,974 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-02-28 17:23:13,974 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-02-28 17:23:13,975 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-02-28 17:23:13,975 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-02-28 17:23:13,975 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-02-28 17:23:13,976 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-02-28 17:23:13,976 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-02-28 17:23:13,976 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-02-28 17:23:13,977 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-02-28 17:23:13,977 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-02-28 17:23:13,978 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 17:23:13,991 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-02-28 17:23:13,991 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 17:23:13,992 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 17:23:13,992 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 17:23:13,992 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 17:23:13,992 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 17:23:13,993 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 17:23:13,993 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 17:23:13,993 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-02-28 17:23:13,993 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 17:23:13,993 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-02-28 17:23:13,993 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-02-28 17:23:13,993 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 17:23:13,993 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 17:23:13,993 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 17:23:13,994 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 17:23:13,994 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 17:23:13,994 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 17:23:13,994 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 17:23:13,994 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-02-28 17:23:13,994 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 17:23:13,994 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-02-28 17:23:13,994 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 17:23:13,994 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 17:23:13,995 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 17:23:13,995 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 17:23:13,995 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:23:13,995 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 17:23:13,995 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 17:23:13,995 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-02-28 17:23:13,995 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 17:23:13,995 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 17:23:13,995 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 17:23:13,996 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 17:23:13,996 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 17:23:13,996 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 17:23:13,996 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-02-28 17:23:13,996 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 -> ad5536c4fd6764a8366f8fc19f92d266221f7e9f3361bf9e76cf5d7ce6ce63b5
[2024-02-28 17:23:14,169 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 17:23:14,188 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 17:23:14,190 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 17:23:14,190 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-02-28 17:23:14,192 INFO  L275        PluginConnector]: CDTParser initialized
[2024-02-28 17:23:14,192 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2024-02-28 17:23:15,340 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 17:23:15,507 INFO  L351              CDTParser]: Found 1 translation units.
[2024-02-28 17:23:15,507 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-init.i
[2024-02-28 17:23:15,517 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/f45d5b264/046d0f018dc74b54b199dffc2494dede/FLAG2a0eab47c
[2024-02-28 17:23:15,527 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/f45d5b264/046d0f018dc74b54b199dffc2494dede
[2024-02-28 17:23:15,528 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 17:23:15,529 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 17:23:15,530 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 17:23:15,530 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 17:23:15,533 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 17:23:15,533 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,534 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b71b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15, skipping insertion in model container
[2024-02-28 17:23:15,534 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,539 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-02-28 17:23:15,575 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-02-28 17:23:15,687 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:23:15,861 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:23:15,866 INFO  L203         MainTranslator]: Completed pre-run
[2024-02-28 17:23:15,875 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-02-28 17:23:15,896 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-02-28 17:23:15,931 INFO  L208         MainTranslator]: Completed translation
[2024-02-28 17:23:15,932 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15 WrapperNode
[2024-02-28 17:23:15,932 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 17:23:15,933 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 17:23:15,933 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 17:23:15,933 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 17:23:15,938 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,952 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,971 INFO  L138                Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 112
[2024-02-28 17:23:15,971 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 17:23:15,972 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 17:23:15,972 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 17:23:15,972 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 17:23:15,979 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,979 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,982 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,982 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,990 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,992 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,994 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,995 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:15,997 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 17:23:15,997 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 17:23:15,997 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 17:23:15,998 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-02-28 17:23:15,998 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (1/1) ...
[2024-02-28 17:23:16,002 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-02-28 17:23:16,010 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:23:16,023 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-02-28 17:23:16,046 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-02-28 17:23:16,073 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 17:23:16,073 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 17:23:16,073 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 17:23:16,074 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 17:23:16,074 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 17:23:16,074 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 17:23:16,074 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 17:23:16,074 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 17:23:16,074 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 17:23:16,074 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 17:23:16,074 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 17:23:16,075 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-02-28 17:23:16,210 INFO  L235             CfgBuilder]: Building ICFG
[2024-02-28 17:23:16,211 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 17:23:16,443 INFO  L276             CfgBuilder]: Performing block encoding
[2024-02-28 17:23:16,469 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 17:23:16,469 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 17:23:16,471 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:23:16 BoogieIcfgContainer
[2024-02-28 17:23:16,471 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 17:23:16,473 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 17:23:16,473 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 17:23:16,475 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-02-28 17:23:16,475 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 05:23:15" (1/3) ...
[2024-02-28 17:23:16,475 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0c9037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:23:16, skipping insertion in model container
[2024-02-28 17:23:16,475 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 05:23:15" (2/3) ...
[2024-02-28 17:23:16,476 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0c9037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 05:23:16, skipping insertion in model container
[2024-02-28 17:23:16,476 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 05:23:16" (3/3) ...
[2024-02-28 17:23:16,477 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i
[2024-02-28 17:23:16,493 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 17:23:16,500 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 17:23:16,500 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2024-02-28 17:23:16,500 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 17:23:16,545 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 17:23:16,572 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2024-02-28 17:23:16,632 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2024-02-28 17:23:16,633 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:23:16,637 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 224 conditions, 218 events. 6/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 374 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. 
[2024-02-28 17:23:16,637 INFO  L82        GeneralOperation]: Start removeDead. Operand has 136 places, 137 transitions, 282 flow
[2024-02-28 17:23:16,641 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 282 flow
[2024-02-28 17:23:16,643 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-02-28 17:23:16,651 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 137 transitions, 282 flow
[2024-02-28 17:23:16,653 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 137 transitions, 282 flow
[2024-02-28 17:23:16,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 137 transitions, 282 flow
[2024-02-28 17:23:16,687 INFO  L130       PetriNetUnfolder]: 6/218 cut-off events.
[2024-02-28 17:23:16,687 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-02-28 17:23:16,688 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 224 conditions, 218 events. 6/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 374 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. 
[2024-02-28 17:23:16,689 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2314
[2024-02-28 17:23:19,022 INFO  L134        LiptonReduction]: Checked pairs total: 10042
[2024-02-28 17:23:19,022 INFO  L136        LiptonReduction]: Total number of compositions: 83
[2024-02-28 17:23:19,036 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 17:23:19,041 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;@79e825b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-02-28 17:23:19,041 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-02-28 17:23:19,043 INFO  L130       PetriNetUnfolder]: 0/14 cut-off events.
[2024-02-28 17:23:19,043 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-02-28 17:23:19,044 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:23:19,044 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-02-28 17:23:19,045 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:23:19,048 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:23:19,048 INFO  L85        PathProgramCache]: Analyzing trace with hash -382401433, now seen corresponding path program 1 times
[2024-02-28 17:23:19,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:23:19,055 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40614887]
[2024-02-28 17:23:19,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:23:19,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:23:19,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:23:19,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:23:19,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:23:19,445 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40614887]
[2024-02-28 17:23:19,445 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40614887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:23:19,445 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:23:19,445 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:23:19,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681564393]
[2024-02-28 17:23:19,447 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:23:19,454 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:23:19,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:23:19,468 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:23:19,469 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:23:19,871 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 220
[2024-02-28 17:23:19,875 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 136 flow. Second operand  has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:19,875 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:23:19,875 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 220
[2024-02-28 17:23:19,876 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:23:20,009 INFO  L130       PetriNetUnfolder]: 57/287 cut-off events.
[2024-02-28 17:23:20,010 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2024-02-28 17:23:20,010 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 477 conditions, 287 events. 57/287 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1290 event pairs, 38 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 352. Up to 115 conditions per place. 
[2024-02-28 17:23:20,012 INFO  L137   encePairwiseOnDemand]: 203/220 looper letters, 40 selfloop transitions, 10 changer transitions 5/82 dead transitions.
[2024-02-28 17:23:20,012 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 282 flow
[2024-02-28 17:23:20,013 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:23:20,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:23:20,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions.
[2024-02-28 17:23:20,030 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5303030303030303
[2024-02-28 17:23:20,031 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 700 transitions.
[2024-02-28 17:23:20,031 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions.
[2024-02-28 17:23:20,035 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:23:20,037 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions.
[2024-02-28 17:23:20,041 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,047 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,048 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,049 INFO  L175             Difference]: Start difference. First operand has 66 places, 64 transitions, 136 flow. Second operand 6 states and 700 transitions.
[2024-02-28 17:23:20,050 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 282 flow
[2024-02-28 17:23:20,052 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 282 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 17:23:20,054 INFO  L231             Difference]: Finished difference. Result has 72 places, 65 transitions, 190 flow
[2024-02-28 17:23:20,055 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=72, PETRI_TRANSITIONS=65}
[2024-02-28 17:23:20,058 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 6 predicate places.
[2024-02-28 17:23:20,058 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 190 flow
[2024-02-28 17:23:20,058 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,058 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:23:20,058 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:23:20,059 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 17:23:20,059 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:23:20,059 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:23:20,059 INFO  L85        PathProgramCache]: Analyzing trace with hash 1094831862, now seen corresponding path program 1 times
[2024-02-28 17:23:20,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:23:20,060 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874904907]
[2024-02-28 17:23:20,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:23:20,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:23:20,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:23:20,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:23:20,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:23:20,108 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874904907]
[2024-02-28 17:23:20,108 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874904907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:23:20,108 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:23:20,108 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 17:23:20,108 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446229572]
[2024-02-28 17:23:20,108 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:23:20,109 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 17:23:20,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:23:20,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 17:23:20,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 17:23:20,154 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 220
[2024-02-28 17:23:20,155 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 190 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-02-28 17:23:20,155 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:23:20,155 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 220
[2024-02-28 17:23:20,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:23:20,231 INFO  L130       PetriNetUnfolder]: 28/243 cut-off events.
[2024-02-28 17:23:20,232 INFO  L131       PetriNetUnfolder]: For 25/25 co-relation queries the response was YES.
[2024-02-28 17:23:20,232 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 423 conditions, 243 events. 28/243 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 985 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 308. Up to 79 conditions per place. 
[2024-02-28 17:23:20,233 INFO  L137   encePairwiseOnDemand]: 216/220 looper letters, 27 selfloop transitions, 3 changer transitions 1/75 dead transitions.
[2024-02-28 17:23:20,233 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 276 flow
[2024-02-28 17:23:20,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 17:23:20,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 17:23:20,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions.
[2024-02-28 17:23:20,236 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6090909090909091
[2024-02-28 17:23:20,236 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 536 transitions.
[2024-02-28 17:23:20,236 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions.
[2024-02-28 17:23:20,237 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:23:20,237 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions.
[2024-02-28 17:23:20,238 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,239 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,240 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,240 INFO  L175             Difference]: Start difference. First operand has 72 places, 65 transitions, 190 flow. Second operand 4 states and 536 transitions.
[2024-02-28 17:23:20,240 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 276 flow
[2024-02-28 17:23:20,242 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 75 transitions, 266 flow, removed 3 selfloop flow, removed 1 redundant places.
[2024-02-28 17:23:20,243 INFO  L231             Difference]: Finished difference. Result has 76 places, 66 transitions, 196 flow
[2024-02-28 17:23:20,243 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=76, PETRI_TRANSITIONS=66}
[2024-02-28 17:23:20,243 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places.
[2024-02-28 17:23:20,244 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 196 flow
[2024-02-28 17:23:20,244 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-02-28 17:23:20,244 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:23:20,244 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:23:20,244 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 17:23:20,244 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:23:20,245 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:23:20,245 INFO  L85        PathProgramCache]: Analyzing trace with hash 1103111380, now seen corresponding path program 1 times
[2024-02-28 17:23:20,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:23:20,245 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298924369]
[2024-02-28 17:23:20,245 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:23:20,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:23:20,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:23:20,409 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:23:20,410 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:23:20,410 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298924369]
[2024-02-28 17:23:20,410 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298924369] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:23:20,410 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:23:20,410 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:23:20,410 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944715242]
[2024-02-28 17:23:20,410 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:23:20,411 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:23:20,411 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:23:20,411 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:23:20,411 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:23:20,652 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 220
[2024-02-28 17:23:20,653 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 196 flow. Second operand  has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,653 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:23:20,653 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 220
[2024-02-28 17:23:20,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:23:20,748 INFO  L130       PetriNetUnfolder]: 58/260 cut-off events.
[2024-02-28 17:23:20,748 INFO  L131       PetriNetUnfolder]: For 15/15 co-relation queries the response was YES.
[2024-02-28 17:23:20,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 535 conditions, 260 events. 58/260 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1139 event pairs, 36 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 404. Up to 111 conditions per place. 
[2024-02-28 17:23:20,750 INFO  L137   encePairwiseOnDemand]: 207/220 looper letters, 40 selfloop transitions, 6 changer transitions 5/77 dead transitions.
[2024-02-28 17:23:20,750 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 322 flow
[2024-02-28 17:23:20,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:23:20,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:23:20,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions.
[2024-02-28 17:23:20,752 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5272727272727272
[2024-02-28 17:23:20,753 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 696 transitions.
[2024-02-28 17:23:20,753 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions.
[2024-02-28 17:23:20,753 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:23:20,753 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions.
[2024-02-28 17:23:20,754 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,756 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,757 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,757 INFO  L175             Difference]: Start difference. First operand has 76 places, 66 transitions, 196 flow. Second operand 6 states and 696 transitions.
[2024-02-28 17:23:20,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 322 flow
[2024-02-28 17:23:20,759 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 77 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 17:23:20,760 INFO  L231             Difference]: Finished difference. Result has 82 places, 63 transitions, 220 flow
[2024-02-28 17:23:20,760 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=82, PETRI_TRANSITIONS=63}
[2024-02-28 17:23:20,760 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 16 predicate places.
[2024-02-28 17:23:20,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 63 transitions, 220 flow
[2024-02-28 17:23:20,761 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:20,761 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:23:20,761 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:23:20,761 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 17:23:20,761 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:23:20,762 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:23:20,762 INFO  L85        PathProgramCache]: Analyzing trace with hash -1153489684, now seen corresponding path program 1 times
[2024-02-28 17:23:20,762 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:23:20,762 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213778854]
[2024-02-28 17:23:20,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:23:20,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:23:20,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:23:20,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:23:20,945 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:23:20,945 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213778854]
[2024-02-28 17:23:20,946 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213778854] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:23:20,946 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:23:20,946 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:23:20,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829306659]
[2024-02-28 17:23:20,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:23:20,946 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:23:20,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:23:20,947 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:23:20,947 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:23:21,175 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 220
[2024-02-28 17:23:21,176 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 63 transitions, 220 flow. Second operand  has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 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-02-28 17:23:21,176 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:23:21,176 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 220
[2024-02-28 17:23:21,177 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:23:21,342 INFO  L130       PetriNetUnfolder]: 254/667 cut-off events.
[2024-02-28 17:23:21,342 INFO  L131       PetriNetUnfolder]: For 109/109 co-relation queries the response was YES.
[2024-02-28 17:23:21,344 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 667 events. 254/667 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3164 event pairs, 211 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 1402. Up to 560 conditions per place. 
[2024-02-28 17:23:21,346 INFO  L137   encePairwiseOnDemand]: 210/220 looper letters, 61 selfloop transitions, 22 changer transitions 0/91 dead transitions.
[2024-02-28 17:23:21,346 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 91 transitions, 442 flow
[2024-02-28 17:23:21,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:23:21,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:23:21,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions.
[2024-02-28 17:23:21,352 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4553030303030303
[2024-02-28 17:23:21,353 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 601 transitions.
[2024-02-28 17:23:21,353 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions.
[2024-02-28 17:23:21,353 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:23:21,353 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions.
[2024-02-28 17:23:21,355 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:21,358 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:21,359 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:21,359 INFO  L175             Difference]: Start difference. First operand has 82 places, 63 transitions, 220 flow. Second operand 6 states and 601 transitions.
[2024-02-28 17:23:21,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 91 transitions, 442 flow
[2024-02-28 17:23:21,362 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 91 transitions, 413 flow, removed 6 selfloop flow, removed 9 redundant places.
[2024-02-28 17:23:21,363 INFO  L231             Difference]: Finished difference. Result has 81 places, 83 transitions, 318 flow
[2024-02-28 17:23:21,364 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=318, PETRI_PLACES=81, PETRI_TRANSITIONS=83}
[2024-02-28 17:23:21,364 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places.
[2024-02-28 17:23:21,365 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 318 flow
[2024-02-28 17:23:21,365 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 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-02-28 17:23:21,365 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:23:21,365 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-02-28 17:23:21,365 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 17:23:21,365 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:23:21,365 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:23:21,366 INFO  L85        PathProgramCache]: Analyzing trace with hash -116177611, now seen corresponding path program 1 times
[2024-02-28 17:23:21,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:23:21,366 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727013437]
[2024-02-28 17:23:21,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:23:21,366 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:23:21,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:23:21,611 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:23:21,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:23:21,611 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727013437]
[2024-02-28 17:23:21,612 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727013437] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:23:21,612 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:23:21,612 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:23:21,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653103]
[2024-02-28 17:23:21,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:23:21,612 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:23:21,612 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:23:21,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:23:21,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:23:21,860 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 220
[2024-02-28 17:23:21,861 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 318 flow. Second operand  has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:21,861 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:23:21,861 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 220
[2024-02-28 17:23:21,862 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:23:22,071 INFO  L130       PetriNetUnfolder]: 161/521 cut-off events.
[2024-02-28 17:23:22,072 INFO  L131       PetriNetUnfolder]: For 233/237 co-relation queries the response was YES.
[2024-02-28 17:23:22,072 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 521 events. 161/521 cut-off events. For 233/237 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2662 event pairs, 25 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 1224. Up to 202 conditions per place. 
[2024-02-28 17:23:22,074 INFO  L137   encePairwiseOnDemand]: 210/220 looper letters, 83 selfloop transitions, 28 changer transitions 26/163 dead transitions.
[2024-02-28 17:23:22,074 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 163 transitions, 885 flow
[2024-02-28 17:23:22,074 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:23:22,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:23:22,076 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions.
[2024-02-28 17:23:22,076 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6303030303030303
[2024-02-28 17:23:22,076 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 832 transitions.
[2024-02-28 17:23:22,076 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions.
[2024-02-28 17:23:22,077 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:23:22,077 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions.
[2024-02-28 17:23:22,078 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:22,080 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:22,080 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:22,080 INFO  L175             Difference]: Start difference. First operand has 81 places, 83 transitions, 318 flow. Second operand 6 states and 832 transitions.
[2024-02-28 17:23:22,080 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 163 transitions, 885 flow
[2024-02-28 17:23:22,083 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 163 transitions, 870 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 17:23:22,084 INFO  L231             Difference]: Finished difference. Result has 90 places, 96 transitions, 543 flow
[2024-02-28 17:23:22,085 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=543, PETRI_PLACES=90, PETRI_TRANSITIONS=96}
[2024-02-28 17:23:22,085 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 24 predicate places.
[2024-02-28 17:23:22,085 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 543 flow
[2024-02-28 17:23:22,086 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:22,086 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:23:22,086 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, 1, 1, 1, 1]
[2024-02-28 17:23:22,086 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 17:23:22,086 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:23:22,086 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:23:22,086 INFO  L85        PathProgramCache]: Analyzing trace with hash 2137239947, now seen corresponding path program 1 times
[2024-02-28 17:23:22,086 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:23:22,087 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340495535]
[2024-02-28 17:23:22,087 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:23:22,087 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:23:22,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:23:22,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 17:23:22,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:23:22,341 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340495535]
[2024-02-28 17:23:22,341 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340495535] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 17:23:22,341 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 17:23:22,342 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 17:23:22,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601798223]
[2024-02-28 17:23:22,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 17:23:22,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 17:23:22,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:23:22,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 17:23:22,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 17:23:22,693 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 117 out of 220
[2024-02-28 17:23:22,694 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 543 flow. Second operand  has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:22,694 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:23:22,694 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 220
[2024-02-28 17:23:22,694 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:23:22,818 INFO  L130       PetriNetUnfolder]: 89/377 cut-off events.
[2024-02-28 17:23:22,819 INFO  L131       PetriNetUnfolder]: For 348/380 co-relation queries the response was YES.
[2024-02-28 17:23:22,819 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 377 events. 89/377 cut-off events. For 348/380 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1824 event pairs, 24 based on Foata normal form. 8/380 useless extension candidates. Maximal degree in co-relation 992. Up to 171 conditions per place. 
[2024-02-28 17:23:22,820 INFO  L137   encePairwiseOnDemand]: 214/220 looper letters, 41 selfloop transitions, 0 changer transitions 21/103 dead transitions.
[2024-02-28 17:23:22,820 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 681 flow
[2024-02-28 17:23:22,821 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 17:23:22,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 17:23:22,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions.
[2024-02-28 17:23:22,823 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5568181818181818
[2024-02-28 17:23:22,823 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 735 transitions.
[2024-02-28 17:23:22,823 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions.
[2024-02-28 17:23:22,823 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:23:22,823 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions.
[2024-02-28 17:23:22,824 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:22,826 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:22,826 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:22,826 INFO  L175             Difference]: Start difference. First operand has 90 places, 96 transitions, 543 flow. Second operand 6 states and 735 transitions.
[2024-02-28 17:23:22,826 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 681 flow
[2024-02-28 17:23:22,849 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 103 transitions, 657 flow, removed 12 selfloop flow, removed 0 redundant places.
[2024-02-28 17:23:22,850 INFO  L231             Difference]: Finished difference. Result has 84 places, 82 transitions, 486 flow
[2024-02-28 17:23:22,851 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=84, PETRI_TRANSITIONS=82}
[2024-02-28 17:23:22,851 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 18 predicate places.
[2024-02-28 17:23:22,851 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 486 flow
[2024-02-28 17:23:22,852 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:22,852 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:23:22,852 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:23:22,852 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 17:23:22,852 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:23:22,853 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:23:22,853 INFO  L85        PathProgramCache]: Analyzing trace with hash -972606990, now seen corresponding path program 1 times
[2024-02-28 17:23:22,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:23:22,853 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104697270]
[2024-02-28 17:23:22,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:23:22,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:23:22,899 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:23:23,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:23:23,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:23:23,709 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104697270]
[2024-02-28 17:23:23,709 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104697270] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:23:23,709 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441220613]
[2024-02-28 17:23:23,709 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:23:23,709 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:23:23,709 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:23:23,712 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-02-28 17:23:23,718 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-02-28 17:23:23,851 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:23:23,856 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjunts are in the unsatisfiable core
[2024-02-28 17:23:23,876 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:23:24,090 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:23:24,091 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 50 treesize of output 49
[2024-02-28 17:23:24,468 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:23:24,468 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 57 treesize of output 54
[2024-02-28 17:23:24,480 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:24,481 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-02-28 17:23:24,680 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 21 treesize of output 13
[2024-02-28 17:23:24,684 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 17:23:24,737 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 17:23:24,780 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:23:24,839 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 40 treesize of output 42
[2024-02-28 17:23:24,919 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 52 treesize of output 57
[2024-02-28 17:23:24,990 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:24,991 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:24,993 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:24,994 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:25,000 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:23:25,000 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67
[2024-02-28 17:23:25,013 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:23:25,014 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:23:26,250 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_30| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_30| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_408 (Array Int Int))) (< |c_ULTIMATE.start_main_#t~mem10#1.offset| (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_30| v_ArrVal_408) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 4))) (forall ((v_ArrVal_409 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_30| v_ArrVal_409) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false
[2024-02-28 17:23:26,304 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 20 treesize of output 16
[2024-02-28 17:23:26,310 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 10 treesize of output 8
[2024-02-28 17:23:26,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:23:26,536 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441220613] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:23:26,536 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:23:26,536 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 42
[2024-02-28 17:23:26,536 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701878393]
[2024-02-28 17:23:26,537 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:23:26,537 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 44 states
[2024-02-28 17:23:26,537 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:23:26,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2024-02-28 17:23:26,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1578, Unknown=17, NotChecked=82, Total=1892
[2024-02-28 17:23:27,280 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 220
[2024-02-28 17:23:27,283 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 486 flow. Second operand  has 44 states, 44 states have (on average 50.54545454545455) internal successors, (2224), 44 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:27,284 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:23:27,284 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 220
[2024-02-28 17:23:27,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:23:29,612 INFO  L130       PetriNetUnfolder]: 444/1028 cut-off events.
[2024-02-28 17:23:29,612 INFO  L131       PetriNetUnfolder]: For 1223/1223 co-relation queries the response was YES.
[2024-02-28 17:23:29,614 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3621 conditions, 1028 events. 444/1028 cut-off events. For 1223/1223 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5028 event pairs, 10 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 3601. Up to 240 conditions per place. 
[2024-02-28 17:23:29,618 INFO  L137   encePairwiseOnDemand]: 205/220 looper letters, 203 selfloop transitions, 46 changer transitions 0/250 dead transitions.
[2024-02-28 17:23:29,618 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 250 transitions, 1918 flow
[2024-02-28 17:23:29,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-02-28 17:23:29,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-02-28 17:23:29,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1057 transitions.
[2024-02-28 17:23:29,622 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2528708133971292
[2024-02-28 17:23:29,622 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1057 transitions.
[2024-02-28 17:23:29,622 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1057 transitions.
[2024-02-28 17:23:29,623 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:23:29,623 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1057 transitions.
[2024-02-28 17:23:29,625 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 55.63157894736842) internal successors, (1057), 19 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:29,628 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 220.0) internal successors, (4400), 20 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:29,629 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 220.0) internal successors, (4400), 20 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:29,629 INFO  L175             Difference]: Start difference. First operand has 84 places, 82 transitions, 486 flow. Second operand 19 states and 1057 transitions.
[2024-02-28 17:23:29,629 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 250 transitions, 1918 flow
[2024-02-28 17:23:29,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 250 transitions, 1915 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 17:23:29,638 INFO  L231             Difference]: Finished difference. Result has 95 places, 122 transitions, 975 flow
[2024-02-28 17:23:29,638 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=975, PETRI_PLACES=95, PETRI_TRANSITIONS=122}
[2024-02-28 17:23:29,639 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 29 predicate places.
[2024-02-28 17:23:29,639 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 122 transitions, 975 flow
[2024-02-28 17:23:29,640 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 44 states, 44 states have (on average 50.54545454545455) internal successors, (2224), 44 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:29,640 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:23:29,640 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:23:29,653 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-02-28 17:23:29,844 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:23:29,845 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:23:29,846 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:23:29,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 1574108551, now seen corresponding path program 1 times
[2024-02-28 17:23:29,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:23:29,847 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427972014]
[2024-02-28 17:23:29,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:23:29,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:23:29,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:23:30,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:23:30,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:23:30,993 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427972014]
[2024-02-28 17:23:30,993 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427972014] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:23:30,993 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76597294]
[2024-02-28 17:23:30,993 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:23:30,993 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:23:30,993 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:23:30,994 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-02-28 17:23:30,995 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-02-28 17:23:31,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:23:31,177 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjunts are in the unsatisfiable core
[2024-02-28 17:23:31,183 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:23:31,345 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:23:31,345 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2024-02-28 17:23:31,352 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:31,353 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 17:23:31,715 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:23:31,716 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 57 treesize of output 54
[2024-02-28 17:23:31,728 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:31,729 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 21
[2024-02-28 17:23:31,924 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-02-28 17:23:31,981 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:31,982 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-02-28 17:23:32,040 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,041 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,045 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-02-28 17:23:32,137 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,138 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,139 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,140 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-02-28 17:23:32,290 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2024-02-28 17:23:32,290 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41
[2024-02-28 17:23:32,304 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 27 treesize of output 13
[2024-02-28 17:23:32,310 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 22 treesize of output 10
[2024-02-28 17:23:32,318 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 17:23:32,383 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,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-02-28 17:23:32,407 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,407 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-02-28 17:23:32,425 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,426 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-02-28 17:23:32,519 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,520 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,521 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,522 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,523 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,525 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,525 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:23:32,527 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:23:32,528 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-02-28 17:23:32,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:23:32,584 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:23:34,515 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_39| .cse3) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false
[2024-02-28 17:23:36,573 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (<= .cse1 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_66|)))))) is different from false
[2024-02-28 17:23:38,644 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= 0 (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|))))))) is different from false
[2024-02-28 17:23:40,715 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0) .cse7 0))) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (not (<= .cse4 |v_ULTIMATE.start_main_~i~1#1_66|))))))) is different from false
[2024-02-28 17:23:42,243 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse4 0) .cse10 0))) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_66| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_39| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_39|)) (forall ((v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_599))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_66| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_39|) v_ArrVal_600))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0)))) (not (<= .cse5 |v_ULTIMATE.start_main_~i~1#1_66|))))))) is different from false
[2024-02-28 17:23:42,349 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:23:42,350 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 79 treesize of output 72
[2024-02-28 17:23:42,371 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:23:42,372 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 232 treesize of output 220
[2024-02-28 17:23:42,401 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 206 treesize of output 198
[2024-02-28 17:23:42,428 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 106 treesize of output 102
[2024-02-28 17:23:42,512 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:23:42,513 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 199 treesize of output 181
[2024-02-28 17:23:42,642 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:23:42,642 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74
[2024-02-28 17:23:42,646 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 17:23:42,655 INFO  L321             Elim1Store]: treesize reduction 8, result has 33.3 percent of original size
[2024-02-28 17:23:42,656 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 130
[2024-02-28 17:23:42,664 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61
[2024-02-28 17:23:42,671 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 158 treesize of output 132
[2024-02-28 17:23:42,698 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:23:42,699 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2024-02-28 17:23:42,705 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:23:42,706 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2024-02-28 17:23:43,213 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_585 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_585) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_584 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_32| Int) (v_ArrVal_585 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_585))) (or (forall ((v_ArrVal_586 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_584))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_586) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_32| (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_587 (Array Int Int))) (not (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_587) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) is different from false
[2024-02-28 17:23:43,295 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_585 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_585) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_584 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_32| Int) (v_ArrVal_585 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_585))) (or (forall ((v_ArrVal_587 (Array Int Int))) (not (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_587) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_586 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_584))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 |v_ULTIMATE.start_main_#t~mem12#1.base_32| v_ArrVal_586) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_32| (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))))) is different from false
[2024-02-28 17:23:43,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2024-02-28 17:23:43,299 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [76597294] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:23:43,300 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:23:43,300 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2024-02-28 17:23:43,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259714518]
[2024-02-28 17:23:43,300 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:23:43,301 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2024-02-28 17:23:43,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:23:43,302 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2024-02-28 17:23:43,303 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1519, Unknown=16, NotChecked=602, Total=2352
[2024-02-28 17:23:43,450 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2024-02-28 17:23:43,453 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 122 transitions, 975 flow. Second operand  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:23:43,453 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:23:43,454 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2024-02-28 17:23:43,454 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:24:09,967 WARN  L233               SmtUtils]: Spent 7.85s on a formula simplification. DAG size of input: 86 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-02-28 17:24:16,061 INFO  L130       PetriNetUnfolder]: 466/1118 cut-off events.
[2024-02-28 17:24:16,062 INFO  L131       PetriNetUnfolder]: For 2119/2119 co-relation queries the response was YES.
[2024-02-28 17:24:16,066 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 1118 events. 466/1118 cut-off events. For 2119/2119 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5792 event pairs, 117 based on Foata normal form. 16/1123 useless extension candidates. Maximal degree in co-relation 4414. Up to 746 conditions per place. 
[2024-02-28 17:24:16,072 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 188 selfloop transitions, 56 changer transitions 0/245 dead transitions.
[2024-02-28 17:24:16,073 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 245 transitions, 2197 flow
[2024-02-28 17:24:16,074 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-02-28 17:24:16,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-02-28 17:24:16,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1402 transitions.
[2024-02-28 17:24:16,078 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2549090909090909
[2024-02-28 17:24:16,078 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1402 transitions.
[2024-02-28 17:24:16,078 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1402 transitions.
[2024-02-28 17:24:16,079 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:24:16,079 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1402 transitions.
[2024-02-28 17:24:16,082 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 56.08) internal successors, (1402), 25 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:16,086 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 220.0) internal successors, (5720), 26 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:16,087 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 220.0) internal successors, (5720), 26 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:16,087 INFO  L175             Difference]: Start difference. First operand has 95 places, 122 transitions, 975 flow. Second operand 25 states and 1402 transitions.
[2024-02-28 17:24:16,087 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 245 transitions, 2197 flow
[2024-02-28 17:24:16,096 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 245 transitions, 2168 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 17:24:16,099 INFO  L231             Difference]: Finished difference. Result has 123 places, 163 transitions, 1496 flow
[2024-02-28 17:24:16,099 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1496, PETRI_PLACES=123, PETRI_TRANSITIONS=163}
[2024-02-28 17:24:16,100 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 57 predicate places.
[2024-02-28 17:24:16,100 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 163 transitions, 1496 flow
[2024-02-28 17:24:16,101 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:16,101 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:24:16,101 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:24:16,106 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-02-28 17:24:16,301 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:24:16,302 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:24:16,303 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:24:16,303 INFO  L85        PathProgramCache]: Analyzing trace with hash -324057465, now seen corresponding path program 2 times
[2024-02-28 17:24:16,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:24:16,304 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453916377]
[2024-02-28 17:24:16,304 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:24:16,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:24:16,343 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:24:17,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:24:17,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:24:17,514 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453916377]
[2024-02-28 17:24:17,514 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453916377] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:24:17,514 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768625831]
[2024-02-28 17:24:17,514 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 17:24:17,515 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:24:17,515 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:24:17,516 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-02-28 17:24:17,517 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-02-28 17:24:17,695 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 17:24:17,695 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:24:17,698 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core
[2024-02-28 17:24:17,704 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:24:17,953 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:24:17,954 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2024-02-28 17:24:17,965 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:17,966 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 17:24:18,512 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:24:18,513 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 64 treesize of output 62
[2024-02-28 17:24:18,526 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:18,527 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 25 treesize of output 25
[2024-02-28 17:24:18,817 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 17:24:18,824 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 22 treesize of output 10
[2024-02-28 17:24:18,899 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-02-28 17:24:18,959 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:18,960 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-02-28 17:24:19,026 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,027 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,029 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-02-28 17:24:19,089 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,090 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,092 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,093 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-02-28 17:24:19,187 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,189 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,191 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,193 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,194 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,196 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,197 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:19,200 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:24:19,201 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-02-28 17:24:19,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:24:19,255 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:24:20,753 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_767))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (not (= (select (select (store .cse0 .cse1 v_ArrVal_768) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_766))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_769) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))) is different from false
[2024-02-28 17:24:20,805 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_767))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_766))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 .cse1 v_ArrVal_769) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))) (not (= (select (select (store .cse3 .cse1 v_ArrVal_768) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))) is different from false
[2024-02-28 17:24:20,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2024-02-28 17:24:20,807 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768625831] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:24:20,808 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:24:20,808 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 44
[2024-02-28 17:24:20,808 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544217186]
[2024-02-28 17:24:20,808 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:24:20,809 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2024-02-28 17:24:20,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:24:20,809 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2024-02-28 17:24:20,810 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1679, Unknown=11, NotChecked=170, Total=2070
[2024-02-28 17:24:21,431 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2024-02-28 17:24:21,434 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 163 transitions, 1496 flow. Second operand  has 46 states, 46 states have (on average 52.45652173913044) internal successors, (2413), 46 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:21,434 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:24:21,435 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2024-02-28 17:24:21,435 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:24:24,965 INFO  L130       PetriNetUnfolder]: 538/1273 cut-off events.
[2024-02-28 17:24:24,965 INFO  L131       PetriNetUnfolder]: For 4500/4500 co-relation queries the response was YES.
[2024-02-28 17:24:24,970 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5879 conditions, 1273 events. 538/1273 cut-off events. For 4500/4500 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6804 event pairs, 16 based on Foata normal form. 20/1282 useless extension candidates. Maximal degree in co-relation 5844. Up to 210 conditions per place. 
[2024-02-28 17:24:24,975 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 282 selfloop transitions, 106 changer transitions 0/389 dead transitions.
[2024-02-28 17:24:24,975 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 389 transitions, 3888 flow
[2024-02-28 17:24:24,975 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-02-28 17:24:24,975 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-02-28 17:24:24,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1508 transitions.
[2024-02-28 17:24:24,979 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2636363636363636
[2024-02-28 17:24:24,979 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1508 transitions.
[2024-02-28 17:24:24,979 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1508 transitions.
[2024-02-28 17:24:24,980 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:24:24,980 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1508 transitions.
[2024-02-28 17:24:24,982 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 58.0) internal successors, (1508), 26 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:24,987 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 220.0) internal successors, (5940), 27 states have internal predecessors, (5940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:24,988 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 220.0) internal successors, (5940), 27 states have internal predecessors, (5940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:24,988 INFO  L175             Difference]: Start difference. First operand has 123 places, 163 transitions, 1496 flow. Second operand 26 states and 1508 transitions.
[2024-02-28 17:24:24,988 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 389 transitions, 3888 flow
[2024-02-28 17:24:25,004 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 389 transitions, 3819 flow, removed 22 selfloop flow, removed 8 redundant places.
[2024-02-28 17:24:25,008 INFO  L231             Difference]: Finished difference. Result has 149 places, 234 transitions, 2434 flow
[2024-02-28 17:24:25,008 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2434, PETRI_PLACES=149, PETRI_TRANSITIONS=234}
[2024-02-28 17:24:25,009 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 83 predicate places.
[2024-02-28 17:24:25,009 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 234 transitions, 2434 flow
[2024-02-28 17:24:25,010 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 46 states, 46 states have (on average 52.45652173913044) internal successors, (2413), 46 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:25,010 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:24:25,010 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:24:25,015 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-02-28 17:24:25,210 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:24:25,211 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:24:25,211 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:24:25,212 INFO  L85        PathProgramCache]: Analyzing trace with hash 1088014417, now seen corresponding path program 3 times
[2024-02-28 17:24:25,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:24:25,212 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920442408]
[2024-02-28 17:24:25,212 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:24:25,212 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:24:25,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:24:25,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:24:25,948 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:24:25,948 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920442408]
[2024-02-28 17:24:25,948 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920442408] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:24:25,948 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614904721]
[2024-02-28 17:24:25,948 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 17:24:25,949 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:24:25,949 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:24:25,950 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-02-28 17:24:25,951 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-02-28 17:24:26,115 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 17:24:26,116 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:24:26,118 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 45 conjunts are in the unsatisfiable core
[2024-02-28 17:24:26,123 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:24:26,289 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:24:26,289 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 50 treesize of output 49
[2024-02-28 17:24:26,637 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:24:26,637 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 64 treesize of output 62
[2024-02-28 17:24:26,651 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:26,654 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 17:24:26,800 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 21 treesize of output 13
[2024-02-28 17:24:26,802 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 17:24:26,867 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-02-28 17:24:26,911 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-02-28 17:24:26,966 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-02-28 17:24:27,037 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-02-28 17:24:27,114 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:27,115 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:27,118 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:27,119 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:27,122 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:24:27,122 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-02-28 17:24:27,133 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:24:27,133 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:24:30,359 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 28 treesize of output 24
[2024-02-28 17:24:30,383 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_944 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) is different from false
[2024-02-28 17:24:30,405 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem8#1.base_44| Int)) (or (forall ((v_ArrVal_944 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem8#1.base_44| v_ArrVal_944) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem8#1.base_44| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false
[2024-02-28 17:24:30,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2024-02-28 17:24:30,407 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614904721] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:24:30,407 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:24:30,408 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 40
[2024-02-28 17:24:30,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244133106]
[2024-02-28 17:24:30,408 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:24:30,409 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-02-28 17:24:30,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:24:30,409 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-02-28 17:24:30,410 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1357, Unknown=13, NotChecked=154, Total=1722
[2024-02-28 17:24:31,486 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2024-02-28 17:24:31,488 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 234 transitions, 2434 flow. Second operand  has 42 states, 42 states have (on average 52.45238095238095) internal successors, (2203), 42 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:31,488 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:24:31,488 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2024-02-28 17:24:31,489 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:24:35,243 INFO  L130       PetriNetUnfolder]: 649/1538 cut-off events.
[2024-02-28 17:24:35,243 INFO  L131       PetriNetUnfolder]: For 9578/9578 co-relation queries the response was YES.
[2024-02-28 17:24:35,248 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8146 conditions, 1538 events. 649/1538 cut-off events. For 9578/9578 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 8754 event pairs, 27 based on Foata normal form. 21/1538 useless extension candidates. Maximal degree in co-relation 8101. Up to 454 conditions per place. 
[2024-02-28 17:24:35,255 INFO  L137   encePairwiseOnDemand]: 201/220 looper letters, 291 selfloop transitions, 148 changer transitions 0/440 dead transitions.
[2024-02-28 17:24:35,255 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 440 transitions, 5114 flow
[2024-02-28 17:24:35,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-02-28 17:24:35,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-02-28 17:24:35,257 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1222 transitions.
[2024-02-28 17:24:35,257 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2645021645021645
[2024-02-28 17:24:35,258 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1222 transitions.
[2024-02-28 17:24:35,258 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1222 transitions.
[2024-02-28 17:24:35,258 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:24:35,258 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1222 transitions.
[2024-02-28 17:24:35,260 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 58.19047619047619) internal successors, (1222), 21 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:35,264 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 220.0) internal successors, (4840), 22 states have internal predecessors, (4840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:35,265 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 220.0) internal successors, (4840), 22 states have internal predecessors, (4840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:35,265 INFO  L175             Difference]: Start difference. First operand has 149 places, 234 transitions, 2434 flow. Second operand 21 states and 1222 transitions.
[2024-02-28 17:24:35,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 440 transitions, 5114 flow
[2024-02-28 17:24:35,298 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 440 transitions, 4973 flow, removed 29 selfloop flow, removed 11 redundant places.
[2024-02-28 17:24:35,303 INFO  L231             Difference]: Finished difference. Result has 171 places, 304 transitions, 3703 flow
[2024-02-28 17:24:35,303 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=2336, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3703, PETRI_PLACES=171, PETRI_TRANSITIONS=304}
[2024-02-28 17:24:35,303 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 105 predicate places.
[2024-02-28 17:24:35,303 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 304 transitions, 3703 flow
[2024-02-28 17:24:35,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 52.45238095238095) internal successors, (2203), 42 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:35,304 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:24:35,304 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:24:35,310 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-02-28 17:24:35,505 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:24:35,505 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:24:35,506 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:24:35,506 INFO  L85        PathProgramCache]: Analyzing trace with hash -189400963, now seen corresponding path program 4 times
[2024-02-28 17:24:35,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:24:35,506 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070811441]
[2024-02-28 17:24:35,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:24:35,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:24:35,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:24:37,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:24:37,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:24:37,177 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070811441]
[2024-02-28 17:24:37,177 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070811441] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:24:37,177 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54431435]
[2024-02-28 17:24:37,177 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 17:24:37,177 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:24:37,177 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:24:37,178 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-02-28 17:24:37,180 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-02-28 17:24:37,631 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 17:24:37,631 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:24:37,634 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 65 conjunts are in the unsatisfiable core
[2024-02-28 17:24:37,649 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:24:37,910 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:24:37,910 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2024-02-28 17:24:37,918 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:37,919 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 17:24:38,432 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:24:38,433 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 64 treesize of output 62
[2024-02-28 17:24:38,442 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:38,443 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 25 treesize of output 25
[2024-02-28 17:24:38,690 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-02-28 17:24:38,756 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:38,756 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-02-28 17:24:38,828 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:38,829 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:38,831 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-02-28 17:24:38,917 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:38,918 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:38,918 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:38,919 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-02-28 17:24:39,015 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2024-02-28 17:24:39,015 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41
[2024-02-28 17:24:39,022 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:24:39,023 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 27 treesize of output 13
[2024-02-28 17:24:39,034 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 22 treesize of output 10
[2024-02-28 17:24:39,045 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 17:24:39,151 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:39,152 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-02-28 17:24:39,189 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:39,190 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-02-28 17:24:39,213 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:39,213 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-02-28 17:24:39,335 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:39,336 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:39,338 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:39,339 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:39,341 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:39,342 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:39,343 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:24:39,345 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:24:39,345 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-02-28 17:24:39,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:24:39,398 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:24:39,635 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false
[2024-02-28 17:24:39,706 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse3) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))))) is different from false
[2024-02-28 17:24:39,772 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0))))))) is different from false
[2024-02-28 17:24:42,601 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0) .cse7 0) .cse10 0)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_45| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_main_#t~mem8#1.offset_45|)) (forall ((v_ArrVal_1136 (Array Int Int)) (v_ArrVal_1138 Int)) (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1136))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_45| .cse2) v_ArrVal_1138))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0))))))) is different from false
[2024-02-28 17:24:42,636 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:24:42,637 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-02-28 17:24:42,650 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:24:42,651 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 248 treesize of output 236
[2024-02-28 17:24:42,664 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 230 treesize of output 214
[2024-02-28 17:24:42,713 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 120 treesize of output 112
[2024-02-28 17:24:42,735 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:24:42,735 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 218 treesize of output 196
[2024-02-28 17:24:42,835 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:24:42,836 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2024-02-28 17:24:42,846 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:24:42,846 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1
[2024-02-28 17:24:42,855 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:24:42,855 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2024-02-28 17:24:43,452 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1121 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1121) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1121))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1123 (Array Int Int))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse0 .cse1 v_ArrVal_1123) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1124 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1122))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_1124) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))))) is different from false
[2024-02-28 17:24:43,523 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1121 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1121) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1121))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1124 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1122))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 .cse2 v_ArrVal_1124) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))) (forall ((v_ArrVal_1123 (Array Int Int))) (not (= (select (select (store .cse3 .cse2 v_ArrVal_1123) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))))))) is different from false
[2024-02-28 17:24:43,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2024-02-28 17:24:43,527 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [54431435] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:24:43,527 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:24:43,527 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 47
[2024-02-28 17:24:43,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485600358]
[2024-02-28 17:24:43,528 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:24:43,529 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 49 states
[2024-02-28 17:24:43,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:24:43,529 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2024-02-28 17:24:43,530 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1598, Unknown=17, NotChecked=522, Total=2352
[2024-02-28 17:24:43,720 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2024-02-28 17:24:43,722 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 304 transitions, 3703 flow. Second operand  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:24:43,722 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:24:43,722 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2024-02-28 17:24:43,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:24:50,823 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 17:24:52,827 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 17:24:54,834 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 17:24:57,495 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 17:24:59,498 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 17:25:01,501 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 17:25:02,553 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-02-28 17:25:15,745 WARN  L233               SmtUtils]: Spent 10.27s on a formula simplification. DAG size of input: 73 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-02-28 17:25:22,143 WARN  L233               SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 73 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-02-28 17:25:26,511 INFO  L130       PetriNetUnfolder]: 715/1716 cut-off events.
[2024-02-28 17:25:26,511 INFO  L131       PetriNetUnfolder]: For 17010/17010 co-relation queries the response was YES.
[2024-02-28 17:25:26,518 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10327 conditions, 1716 events. 715/1716 cut-off events. For 17010/17010 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10094 event pairs, 158 based on Foata normal form. 16/1732 useless extension candidates. Maximal degree in co-relation 10269. Up to 1042 conditions per place. 
[2024-02-28 17:25:26,526 INFO  L137   encePairwiseOnDemand]: 196/220 looper letters, 291 selfloop transitions, 144 changer transitions 0/436 dead transitions.
[2024-02-28 17:25:26,526 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 436 transitions, 5584 flow
[2024-02-28 17:25:26,527 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-02-28 17:25:26,527 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-02-28 17:25:26,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1381 transitions.
[2024-02-28 17:25:26,530 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2615530303030303
[2024-02-28 17:25:26,530 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1381 transitions.
[2024-02-28 17:25:26,530 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1381 transitions.
[2024-02-28 17:25:26,532 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:25:26,532 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1381 transitions.
[2024-02-28 17:25:26,539 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 57.541666666666664) internal successors, (1381), 24 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:26,543 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 220.0) internal successors, (5500), 25 states have internal predecessors, (5500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:26,543 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 220.0) internal successors, (5500), 25 states have internal predecessors, (5500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:26,543 INFO  L175             Difference]: Start difference. First operand has 171 places, 304 transitions, 3703 flow. Second operand 24 states and 1381 transitions.
[2024-02-28 17:25:26,543 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 436 transitions, 5584 flow
[2024-02-28 17:25:26,638 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 436 transitions, 5502 flow, removed 30 selfloop flow, removed 7 redundant places.
[2024-02-28 17:25:26,643 INFO  L231             Difference]: Finished difference. Result has 201 places, 364 transitions, 4882 flow
[2024-02-28 17:25:26,644 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=3625, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4882, PETRI_PLACES=201, PETRI_TRANSITIONS=364}
[2024-02-28 17:25:26,644 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 135 predicate places.
[2024-02-28 17:25:26,644 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 364 transitions, 4882 flow
[2024-02-28 17:25:26,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 49 states, 49 states have (on average 52.30612244897959) internal successors, (2563), 49 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:26,645 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:25:26,645 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:25:26,653 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-02-28 17:25:26,846 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,SelfDestructingSolverStorable10
[2024-02-28 17:25:26,847 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:25:26,847 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:25:26,847 INFO  L85        PathProgramCache]: Analyzing trace with hash -908669383, now seen corresponding path program 5 times
[2024-02-28 17:25:26,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:25:26,848 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332823526]
[2024-02-28 17:25:26,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:25:26,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:25:26,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:25:27,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:25:27,879 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:25:27,879 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332823526]
[2024-02-28 17:25:27,879 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332823526] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:25:27,879 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112209900]
[2024-02-28 17:25:27,879 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-02-28 17:25:27,879 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:25:27,880 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:25:27,881 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-02-28 17:25:27,883 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-02-28 17:25:28,091 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 17:25:28,091 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:25:28,094 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core
[2024-02-28 17:25:28,099 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:25:28,355 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:25:28,356 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2024-02-28 17:25:28,366 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:28,367 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 17:25:28,827 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:28,828 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 21
[2024-02-28 17:25:28,854 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:25:28,855 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 57 treesize of output 54
[2024-02-28 17:25:29,113 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 17:25:29,119 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 22 treesize of output 10
[2024-02-28 17:25:29,188 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-02-28 17:25:29,239 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,240 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-02-28 17:25:29,296 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,297 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,298 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-02-28 17:25:29,374 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,375 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,376 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,377 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-02-28 17:25:29,478 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,480 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,481 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,483 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,484 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,485 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,486 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:29,489 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:25:29,490 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-02-28 17:25:29,549 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:25:29,549 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:25:30,843 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_40| Int)) (or (forall ((v_ArrVal_1305 (Array Int Int))) (< |c_ULTIMATE.start_main_#t~mem10#1.offset| (+ 1 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_40| v_ArrVal_1305) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_40| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_1306 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_40| v_ArrVal_1306) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false
[2024-02-28 17:25:30,900 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_40| Int)) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ 1 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_40| v_ArrVal_1305) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_40| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_40| v_ArrVal_1306) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false
[2024-02-28 17:25:30,972 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1303 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_40| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1303))) (or (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1304))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_40| v_ArrVal_1305) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))) (not (= (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_40| v_ArrVal_1306) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_40| (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) is different from false
[2024-02-28 17:25:31,043 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1304 (Array Int Int)) (v_ArrVal_1303 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1.base_40| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1303))) (or (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_40| (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem12#1.base_40| v_ArrVal_1306) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1304))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem12#1.base_40| v_ArrVal_1305) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1))))))) is different from false
[2024-02-28 17:25:31,045 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked.
[2024-02-28 17:25:31,045 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112209900] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:25:31,046 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:25:31,046 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 44
[2024-02-28 17:25:31,046 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950670399]
[2024-02-28 17:25:31,046 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:25:31,047 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2024-02-28 17:25:31,047 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:25:31,047 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2024-02-28 17:25:31,048 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1530, Unknown=8, NotChecked=332, Total=2070
[2024-02-28 17:25:31,742 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2024-02-28 17:25:31,744 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 364 transitions, 4882 flow. Second operand  has 46 states, 46 states have (on average 52.45652173913044) internal successors, (2413), 46 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:31,744 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:25:31,745 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2024-02-28 17:25:31,745 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:25:36,633 INFO  L130       PetriNetUnfolder]: 904/2111 cut-off events.
[2024-02-28 17:25:36,633 INFO  L131       PetriNetUnfolder]: For 31003/31003 co-relation queries the response was YES.
[2024-02-28 17:25:36,642 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14223 conditions, 2111 events. 904/2111 cut-off events. For 31003/31003 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12954 event pairs, 58 based on Foata normal form. 21/2132 useless extension candidates. Maximal degree in co-relation 14151. Up to 460 conditions per place. 
[2024-02-28 17:25:36,652 INFO  L137   encePairwiseOnDemand]: 200/220 looper letters, 444 selfloop transitions, 189 changer transitions 0/634 dead transitions.
[2024-02-28 17:25:36,653 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 634 transitions, 8992 flow
[2024-02-28 17:25:36,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-02-28 17:25:36,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-02-28 17:25:36,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1417 transitions.
[2024-02-28 17:25:36,657 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2683712121212121
[2024-02-28 17:25:36,658 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1417 transitions.
[2024-02-28 17:25:36,658 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1417 transitions.
[2024-02-28 17:25:36,658 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:25:36,658 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1417 transitions.
[2024-02-28 17:25:36,660 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 59.041666666666664) internal successors, (1417), 24 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:36,663 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 220.0) internal successors, (5500), 25 states have internal predecessors, (5500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:36,663 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 220.0) internal successors, (5500), 25 states have internal predecessors, (5500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:36,663 INFO  L175             Difference]: Start difference. First operand has 201 places, 364 transitions, 4882 flow. Second operand 24 states and 1417 transitions.
[2024-02-28 17:25:36,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 634 transitions, 8992 flow
[2024-02-28 17:25:36,772 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 634 transitions, 8815 flow, removed 62 selfloop flow, removed 8 redundant places.
[2024-02-28 17:25:36,779 INFO  L231             Difference]: Finished difference. Result has 226 places, 432 transitions, 6393 flow
[2024-02-28 17:25:36,780 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=4769, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6393, PETRI_PLACES=226, PETRI_TRANSITIONS=432}
[2024-02-28 17:25:36,780 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 160 predicate places.
[2024-02-28 17:25:36,780 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 432 transitions, 6393 flow
[2024-02-28 17:25:36,781 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 46 states, 46 states have (on average 52.45652173913044) internal successors, (2413), 46 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:36,781 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:25:36,781 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:25:36,789 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-02-28 17:25:36,982 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,SelfDestructingSolverStorable11
[2024-02-28 17:25:36,983 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:25:36,983 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:25:36,984 INFO  L85        PathProgramCache]: Analyzing trace with hash 439464892, now seen corresponding path program 2 times
[2024-02-28 17:25:36,984 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:25:36,984 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966594046]
[2024-02-28 17:25:36,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:25:36,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:25:37,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:25:37,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:25:37,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:25:37,666 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966594046]
[2024-02-28 17:25:37,667 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966594046] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:25:37,667 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272157060]
[2024-02-28 17:25:37,667 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 17:25:37,667 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:25:37,667 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:25:37,668 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-02-28 17:25:37,669 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-02-28 17:25:37,885 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 17:25:37,885 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:25:37,887 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjunts are in the unsatisfiable core
[2024-02-28 17:25:37,894 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:25:38,048 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:25:38,048 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 50 treesize of output 49
[2024-02-28 17:25:38,368 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:25:38,369 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 57 treesize of output 54
[2024-02-28 17:25:38,378 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:38,378 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-02-28 17:25:38,536 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 21 treesize of output 13
[2024-02-28 17:25:38,542 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 17:25:38,600 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 15 treesize of output 11
[2024-02-28 17:25:38,659 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 17:25:38,716 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 40 treesize of output 42
[2024-02-28 17:25:38,778 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 52 treesize of output 57
[2024-02-28 17:25:38,842 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:38,844 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:38,845 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:38,847 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:38,849 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:25:38,849 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 67
[2024-02-28 17:25:38,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:25:38,857 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:25:40,113 WARN  L837   $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem12#1.base_42| Int)) (or (not (<= |v_ULTIMATE.start_main_#t~mem12#1.base_42| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_1483 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem12#1.base_42| v_ArrVal_1483) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1482 (Array Int Int))) (< |c_ULTIMATE.start_main_#t~mem10#1.offset| (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem12#1.base_42| v_ArrVal_1482) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))))) is different from false
[2024-02-28 17:25:40,181 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 20 treesize of output 16
[2024-02-28 17:25:40,189 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 10 treesize of output 8
[2024-02-28 17:25:40,245 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 (Array Int Int))) (not (<= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1481) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-02-28 17:25:40,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked.
[2024-02-28 17:25:40,382 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272157060] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:25:40,382 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:25:40,382 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 41
[2024-02-28 17:25:40,382 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681047094]
[2024-02-28 17:25:40,383 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:25:40,383 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 43 states
[2024-02-28 17:25:40,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:25:40,384 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2024-02-28 17:25:40,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1436, Unknown=4, NotChecked=158, Total=1806
[2024-02-28 17:25:40,787 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 220
[2024-02-28 17:25:40,788 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 432 transitions, 6393 flow. Second operand  has 43 states, 43 states have (on average 50.51162790697674) internal successors, (2172), 43 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:40,788 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:25:40,788 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 220
[2024-02-28 17:25:40,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:25:44,023 INFO  L130       PetriNetUnfolder]: 936/2185 cut-off events.
[2024-02-28 17:25:44,023 INFO  L131       PetriNetUnfolder]: For 38150/38150 co-relation queries the response was YES.
[2024-02-28 17:25:44,034 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15961 conditions, 2185 events. 936/2185 cut-off events. For 38150/38150 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 13593 event pairs, 74 based on Foata normal form. 10/2195 useless extension candidates. Maximal degree in co-relation 15880. Up to 880 conditions per place. 
[2024-02-28 17:25:44,043 INFO  L137   encePairwiseOnDemand]: 206/220 looper letters, 442 selfloop transitions, 135 changer transitions 0/578 dead transitions.
[2024-02-28 17:25:44,043 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 578 transitions, 9348 flow
[2024-02-28 17:25:44,044 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-02-28 17:25:44,044 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-02-28 17:25:44,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 891 transitions.
[2024-02-28 17:25:44,045 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.253125
[2024-02-28 17:25:44,045 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 891 transitions.
[2024-02-28 17:25:44,045 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 891 transitions.
[2024-02-28 17:25:44,045 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:25:44,045 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 891 transitions.
[2024-02-28 17:25:44,046 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 55.6875) internal successors, (891), 16 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:44,079 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 220.0) internal successors, (3740), 17 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:44,079 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 220.0) internal successors, (3740), 17 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:44,079 INFO  L175             Difference]: Start difference. First operand has 226 places, 432 transitions, 6393 flow. Second operand 16 states and 891 transitions.
[2024-02-28 17:25:44,079 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 578 transitions, 9348 flow
[2024-02-28 17:25:44,235 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 578 transitions, 9182 flow, removed 59 selfloop flow, removed 9 redundant places.
[2024-02-28 17:25:44,242 INFO  L231             Difference]: Finished difference. Result has 237 places, 464 transitions, 7012 flow
[2024-02-28 17:25:44,242 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=6227, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7012, PETRI_PLACES=237, PETRI_TRANSITIONS=464}
[2024-02-28 17:25:44,243 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 171 predicate places.
[2024-02-28 17:25:44,243 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 464 transitions, 7012 flow
[2024-02-28 17:25:44,243 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 43 states, 43 states have (on average 50.51162790697674) internal successors, (2172), 43 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:25:44,243 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:25:44,243 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:25:44,249 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-02-28 17:25:44,448 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,SelfDestructingSolverStorable12
[2024-02-28 17:25:44,449 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:25:44,449 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:25:44,449 INFO  L85        PathProgramCache]: Analyzing trace with hash 395210955, now seen corresponding path program 6 times
[2024-02-28 17:25:44,449 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:25:44,450 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783218669]
[2024-02-28 17:25:44,450 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:25:44,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:25:44,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:25:45,810 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:25:45,810 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:25:45,810 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783218669]
[2024-02-28 17:25:45,810 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783218669] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:25:45,810 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760901954]
[2024-02-28 17:25:45,811 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-02-28 17:25:45,811 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:25:45,811 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:25:45,812 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-02-28 17:25:45,813 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-02-28 17:25:46,002 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-02-28 17:25:46,002 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 17:25:46,004 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 61 conjunts are in the unsatisfiable core
[2024-02-28 17:25:46,010 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:25:46,275 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:25:46,275 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2024-02-28 17:25:46,284 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:46,284 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 17:25:46,819 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:25:46,819 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 64 treesize of output 62
[2024-02-28 17:25:46,831 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:46,832 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 25 treesize of output 25
[2024-02-28 17:25:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:25:47,206 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,207 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-02-28 17:25:47,283 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,284 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,285 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-02-28 17:25:47,381 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,383 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,385 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,385 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-02-28 17:25:47,487 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 22 treesize of output 10
[2024-02-28 17:25:47,494 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 17:25:47,503 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,504 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-02-28 17:25:47,591 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,591 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-02-28 17:25:47,609 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,610 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-02-28 17:25:47,647 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,648 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-02-28 17:25:47,757 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,758 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,759 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,760 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,761 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,762 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,763 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:25:47,766 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:25:47,766 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-02-28 17:25:47,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:25:47,826 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:25:47,992 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1675 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1675))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1675 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1675))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1675 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1675))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1675 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1675))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false
[2024-02-28 17:25:48,074 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)) (forall ((v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1675 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1675))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (forall ((v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1675 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1675))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (forall ((v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1675 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1675))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_51| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_51|)) (forall ((v_ArrVal_1673 (Array Int Int)) (v_ArrVal_1675 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1673))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_51| .cse3) v_ArrVal_1675))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false
[2024-02-28 17:26:03,893 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:26:03,893 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-02-28 17:26:03,929 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:26:03,929 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 444 treesize of output 416
[2024-02-28 17:26:03,937 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 446 treesize of output 414
[2024-02-28 17:26:03,965 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 226
[2024-02-28 17:26:04,056 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:26:04,056 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 329 treesize of output 303
[2024-02-28 17:26:04,293 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:26:04,294 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2024-02-28 17:26:04,302 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:26:04,302 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1
[2024-02-28 17:26:04,313 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 17:26:04,313 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1
[2024-02-28 17:26:09,363 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1659 (Array Int Int)) (v_ArrVal_1658 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1658))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1661 (Array Int Int))) (not (= (select (select (store .cse0 .cse1 v_ArrVal_1661) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1660 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1659))) (< (select (select .cse2 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse2 .cse1 v_ArrVal_1660) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))) (forall ((v_ArrVal_1658 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~#is~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1658) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))))) is different from false
[2024-02-28 17:26:09,435 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((v_ArrVal_1658 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1658) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) |c_ULTIMATE.start_main_~#is~0#1.base|))) (forall ((v_ArrVal_1659 (Array Int Int)) (v_ArrVal_1658 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1658))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (or (forall ((v_ArrVal_1661 (Array Int Int))) (not (= (select (select .cse1 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (select (select (store .cse1 .cse2 v_ArrVal_1661) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (forall ((v_ArrVal_1660 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1659))) (< (select (select .cse3 |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) (+ (select (select (store .cse3 .cse2 v_ArrVal_1660) |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|) 1)))))))))) is different from false
[2024-02-28 17:26:09,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked.
[2024-02-28 17:26:09,439 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760901954] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 17:26:09,439 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 17:26:09,439 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 46
[2024-02-28 17:26:09,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936950687]
[2024-02-28 17:26:09,440 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 17:26:09,441 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 48 states
[2024-02-28 17:26:09,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 17:26:09,442 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants.
[2024-02-28 17:26:09,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1629, Unknown=41, NotChecked=348, Total=2256
[2024-02-28 17:26:09,463 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 220
[2024-02-28 17:26:09,465 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 464 transitions, 7012 flow. Second operand  has 48 states, 48 states have (on average 52.354166666666664) internal successors, (2513), 48 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:26:09,465 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 17:26:09,465 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 220
[2024-02-28 17:26:09,466 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 17:26:21,559 INFO  L130       PetriNetUnfolder]: 976/2344 cut-off events.
[2024-02-28 17:26:21,559 INFO  L131       PetriNetUnfolder]: For 45096/45096 co-relation queries the response was YES.
[2024-02-28 17:26:21,570 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17484 conditions, 2344 events. 976/2344 cut-off events. For 45096/45096 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 15142 event pairs, 194 based on Foata normal form. 16/2360 useless extension candidates. Maximal degree in co-relation 17397. Up to 1439 conditions per place. 
[2024-02-28 17:26:21,577 INFO  L137   encePairwiseOnDemand]: 198/220 looper letters, 399 selfloop transitions, 184 changer transitions 0/584 dead transitions.
[2024-02-28 17:26:21,578 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 584 transitions, 9670 flow
[2024-02-28 17:26:21,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-02-28 17:26:21,579 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2024-02-28 17:26:21,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1320 transitions.
[2024-02-28 17:26:21,580 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2608695652173913
[2024-02-28 17:26:21,580 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1320 transitions.
[2024-02-28 17:26:21,580 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1320 transitions.
[2024-02-28 17:26:21,581 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 17:26:21,581 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1320 transitions.
[2024-02-28 17:26:21,582 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 57.391304347826086) internal successors, (1320), 23 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:26:21,585 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 220.0) internal successors, (5280), 24 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:26:21,586 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 220.0) internal successors, (5280), 24 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:26:21,586 INFO  L175             Difference]: Start difference. First operand has 237 places, 464 transitions, 7012 flow. Second operand 23 states and 1320 transitions.
[2024-02-28 17:26:21,586 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 584 transitions, 9670 flow
[2024-02-28 17:26:21,762 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 584 transitions, 9367 flow, removed 40 selfloop flow, removed 10 redundant places.
[2024-02-28 17:26:21,770 INFO  L231             Difference]: Finished difference. Result has 260 places, 505 transitions, 8239 flow
[2024-02-28 17:26:21,770 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=6748, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=8239, PETRI_PLACES=260, PETRI_TRANSITIONS=505}
[2024-02-28 17:26:21,770 INFO  L288   CegarLoopForPetriNet]: 66 programPoint places, 194 predicate places.
[2024-02-28 17:26:21,771 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 505 transitions, 8239 flow
[2024-02-28 17:26:21,771 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 48 states, 48 states have (on average 52.354166666666664) internal successors, (2513), 48 states have internal predecessors, (2513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 17:26:21,771 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-02-28 17:26:21,771 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 17:26:21,779 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2024-02-28 17:26:21,972 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,SelfDestructingSolverStorable13
[2024-02-28 17:26:21,973 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-02-28 17:26:21,973 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 17:26:21,973 INFO  L85        PathProgramCache]: Analyzing trace with hash 1705804265, now seen corresponding path program 7 times
[2024-02-28 17:26:21,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 17:26:21,974 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679939176]
[2024-02-28 17:26:21,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 17:26:21,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 17:26:22,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:26:25,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:26:25,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 17:26:25,505 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679939176]
[2024-02-28 17:26:25,505 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679939176] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 17:26:25,505 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371925556]
[2024-02-28 17:26:25,505 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-02-28 17:26:25,506 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 17:26:25,506 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-02-28 17:26:25,507 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-02-28 17:26:25,508 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-02-28 17:26:25,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 17:26:25,667 INFO  L263         TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 60 conjunts are in the unsatisfiable core
[2024-02-28 17:26:25,672 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 17:26:25,878 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:26:25,878 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 57
[2024-02-28 17:26:25,882 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:25,882 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-02-28 17:26:26,335 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-02-28 17:26:26,336 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 57 treesize of output 54
[2024-02-28 17:26:26,346 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:26,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 21 treesize of output 21
[2024-02-28 17:26:26,562 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 17:26:26,707 INFO  L321             Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2024-02-28 17:26:26,707 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20
[2024-02-28 17:26:26,713 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-02-28 17:26:26,718 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 22 treesize of output 10
[2024-02-28 17:26:26,724 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 17:26:26,788 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:26,788 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-02-28 17:26:26,862 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:26,863 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-02-28 17:26:26,885 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:26,886 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:26,886 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-02-28 17:26:26,971 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:26,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 32 treesize of output 30
[2024-02-28 17:26:26,995 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:26,996 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:26,996 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:26,997 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-02-28 17:26:27,109 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:27,109 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-02-28 17:26:27,226 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:27,227 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:27,229 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:27,230 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:27,231 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:27,232 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:27,233 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 17:26:27,235 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:26:27,235 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58
[2024-02-28 17:26:27,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 17:26:27,299 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 17:26:27,504 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false
[2024-02-28 17:26:32,607 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse4 (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false
[2024-02-28 17:26:32,641 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse0 (store (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse5 (store (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse7 (store (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse10 (store (let ((.cse11 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse10 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0))))) is different from false
[2024-02-28 17:26:32,684 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (and (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse0 (store (let ((.cse2 (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse6 (store (let ((.cse7 (store (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse9 (store (let ((.cse10 (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse10 c_threadThread1of1ForFork0_~p~0.base (store (select .cse10 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse12 (store (let ((.cse13 (store (let ((.cse14 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse14 c_threadThread1of1ForFork0_~p~0.base (store (select .cse14 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse12 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse12 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)))) is different from false
[2024-02-28 17:26:32,781 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse6 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse10 0)))) (and (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse0 (store (let ((.cse2 (store (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse2 c_threadThread1of1ForFork0_~p~0.base (store (select .cse2 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= 0 (select (select (let ((.cse7 (store (let ((.cse8 (store (let ((.cse9 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse9 c_threadThread1of1ForFork0_~p~0.base (store (select .cse9 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse10))) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse11 (store (let ((.cse12 (store (let ((.cse13 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse11 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse11 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0)) (forall ((v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse14 (store (let ((.cse15 (store (let ((.cse16 (store .cse6 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse14 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse14 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0))))) is different from false
[2024-02-28 17:26:32,918 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_53| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_53|)) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse1 (store (let ((.cse4 (store (let ((.cse6 (store (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1846))) (store .cse8 c_threadThread1of1ForFork0_~p~0.base (store (select .cse8 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse6 c_threadThread1of1ForFork0_~p~0.base (store (select .cse6 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse4 c_threadThread1of1ForFork0_~p~0.base (store (select .cse4 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_53| .cse3) v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse9) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_53| Int)) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse10 (store (let ((.cse11 (store (let ((.cse12 (store (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1846))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_53| .cse3) v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_53|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_53| Int)) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= 0 (select (select (let ((.cse14 (store (let ((.cse15 (store (let ((.cse16 (store (let ((.cse17 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1846))) (store .cse17 c_threadThread1of1ForFork0_~p~0.base (store (select .cse17 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse14 .cse2 (store (select .cse14 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_53| .cse3) v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse5))) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_53|)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_53| Int)) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse18 (store (let ((.cse19 (store (let ((.cse20 (store (let ((.cse21 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1846))) (store .cse21 c_threadThread1of1ForFork0_~p~0.base (store (select .cse21 c_threadThread1of1ForFork0_~p~0.base) .cse9 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse20 c_threadThread1of1ForFork0_~p~0.base (store (select .cse20 c_threadThread1of1ForFork0_~p~0.base) .cse7 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse19 c_threadThread1of1ForFork0_~p~0.base (store (select .cse19 c_threadThread1of1ForFork0_~p~0.base) .cse5 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse18 .cse2 (store (select .cse18 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_53| .cse3) v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse0 |v_ULTIMATE.start_main_#t~mem8#1.offset_53|)))))) is different from false
[2024-02-28 17:26:35,033 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_80| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_80|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_53| Int)) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse1 (store (let ((.cse3 (store (let ((.cse5 (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1846))) (store .cse7 c_threadThread1of1ForFork0_~p~0.base (store (select .cse7 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse5 c_threadThread1of1ForFork0_~p~0.base (store (select .cse5 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse3 c_threadThread1of1ForFork0_~p~0.base (store (select .cse3 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_53| (* |v_ULTIMATE.start_main_~i~1#1_80| 4)) v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_53|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_80| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_80|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_53| Int)) (or (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_53|)) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse10 (store (let ((.cse11 (store (let ((.cse12 (store (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1846))) (store .cse13 c_threadThread1of1ForFork0_~p~0.base (store (select .cse13 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse12 c_threadThread1of1ForFork0_~p~0.base (store (select .cse12 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse11 c_threadThread1of1ForFork0_~p~0.base (store (select .cse11 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse10 .cse2 (store (select .cse10 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_53| (* |v_ULTIMATE.start_main_~i~1#1_80| 4)) v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_80| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_80|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_53| Int)) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse14 (store (let ((.cse15 (store (let ((.cse16 (store (let ((.cse17 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1846))) (store .cse17 c_threadThread1of1ForFork0_~p~0.base (store (select .cse17 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse16 c_threadThread1of1ForFork0_~p~0.base (store (select .cse16 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse15 c_threadThread1of1ForFork0_~p~0.base (store (select .cse15 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse14 .cse2 (store (select .cse14 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_53| (* |v_ULTIMATE.start_main_~i~1#1_80| 4)) v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse6) 0)) (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_53|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_80| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~1#1_80|)) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_53| Int)) (or (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1855 (Array Int Int)) (v_ArrVal_1852 (Array Int Int)) (v_ArrVal_1849 (Array Int Int)) (v_ArrVal_1856 Int)) (= (select (select (let ((.cse18 (store (let ((.cse19 (store (let ((.cse20 (store (let ((.cse21 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1846))) (store .cse21 c_threadThread1of1ForFork0_~p~0.base (store (select .cse21 c_threadThread1of1ForFork0_~p~0.base) .cse8 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1849))) (store .cse20 c_threadThread1of1ForFork0_~p~0.base (store (select .cse20 c_threadThread1of1ForFork0_~p~0.base) .cse6 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1852))) (store .cse19 c_threadThread1of1ForFork0_~p~0.base (store (select .cse19 c_threadThread1of1ForFork0_~p~0.base) .cse4 0))) |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_1855))) (store .cse18 .cse2 (store (select .cse18 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_53| (* |v_ULTIMATE.start_main_~i~1#1_80| 4)) v_ArrVal_1856))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0)) (not (<= .cse9 |v_ULTIMATE.start_main_#t~mem8#1.offset_53|)))))))) is different from false
[2024-02-28 17:26:35,078 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:26:35,078 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 387 treesize of output 268
[2024-02-28 17:26:40,729 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 17:26:40,765 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 36886340670 treesize of output 36853607624
Killed by 15
