./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-race.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d76df1bfaca9781352b9c7afbe4683f5e649e880008edad8122f422eebb0dbe8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 04:46:44,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 04:46:44,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-11 04:46:44,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 04:46:44,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 04:46:44,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 04:46:44,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 04:46:44,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 04:46:44,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 04:46:44,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 04:46:44,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 04:46:44,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 04:46:44,788 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 04:46:44,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 04:46:44,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 04:46:44,789 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 04:46:44,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 04:46:44,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 04:46:44,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 04:46:44,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 04:46:44,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 04:46:44,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 04:46:44,794 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-11 04:46:44,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 04:46:44,799 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-11 04:46:44,801 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 04:46:44,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 04:46:44,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 04:46:44,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 04:46:44,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 04:46:44,802 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-11 04:46:44,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 04:46:44,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 04:46:44,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 04:46:44,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 04:46:44,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 04:46:44,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 04:46:44,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 04:46:44,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 04:46:44,805 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-11 04:46:44,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-11 04:46:44,806 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-11 04:46:44,806 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-11 04:46:44,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> GemCutter 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 -> d76df1bfaca9781352b9c7afbe4683f5e649e880008edad8122f422eebb0dbe8 [2024-11-11 04:46:45,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 04:46:45,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 04:46:45,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 04:46:45,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 04:46:45,076 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 04:46:45,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-race.i [2024-11-11 04:46:46,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 04:46:46,813 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 04:46:46,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-race.i [2024-11-11 04:46:46,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f2eceb313/0e61847f2a0c463c83ac1ef4c99baafa/FLAGb5a97a848 [2024-11-11 04:46:46,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f2eceb313/0e61847f2a0c463c83ac1ef4c99baafa [2024-11-11 04:46:46,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 04:46:46,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 04:46:46,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 04:46:46,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 04:46:46,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 04:46:46,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:46:46" (1/1) ... [2024-11-11 04:46:46,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae7b6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:46, skipping insertion in model container [2024-11-11 04:46:46,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:46:46" (1/1) ... [2024-11-11 04:46:46,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 04:46:47,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 04:46:47,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 04:46:47,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 04:46:47,370 INFO L204 MainTranslator]: Completed translation [2024-11-11 04:46:47,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47 WrapperNode [2024-11-11 04:46:47,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 04:46:47,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 04:46:47,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 04:46:47,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 04:46:47,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (1/1) ... [2024-11-11 04:46:47,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (1/1) ... [2024-11-11 04:46:47,448 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 201 [2024-11-11 04:46:47,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 04:46:47,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 04:46:47,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 04:46:47,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 04:46:47,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (1/1) ... [2024-11-11 04:46:47,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (1/1) ... [2024-11-11 04:46:47,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (1/1) ... [2024-11-11 04:46:47,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (1/1) ... [2024-11-11 04:46:47,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (1/1) ... [2024-11-11 04:46:47,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (1/1) ... [2024-11-11 04:46:47,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (1/1) ... [2024-11-11 04:46:47,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (1/1) ... [2024-11-11 04:46:47,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 04:46:47,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 04:46:47,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 04:46:47,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 04:46:47,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (1/1) ... [2024-11-11 04:46:47,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 04:46:47,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 04:46:47,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-11 04:46:47,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-11 04:46:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-11 04:46:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-11 04:46:47,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-11 04:46:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-11 04:46:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-11 04:46:47,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 04:46:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 04:46:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 04:46:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-11 04:46:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-11 04:46:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 04:46:47,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 04:46:47,600 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-11 04:46:47,710 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 04:46:47,712 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 04:46:48,049 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-11 04:46:48,050 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 04:46:48,177 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 04:46:48,177 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 04:46:48,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:46:48 BoogieIcfgContainer [2024-11-11 04:46:48,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 04:46:48,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 04:46:48,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 04:46:48,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 04:46:48,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:46:46" (1/3) ... [2024-11-11 04:46:48,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7890a7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:46:48, skipping insertion in model container [2024-11-11 04:46:48,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:46:47" (2/3) ... [2024-11-11 04:46:48,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7890a7d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:46:48, skipping insertion in model container [2024-11-11 04:46:48,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:46:48" (3/3) ... [2024-11-11 04:46:48,186 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-race.i [2024-11-11 04:46:48,204 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 04:46:48,204 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-11 04:46:48,205 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-11 04:46:48,288 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-11 04:46:48,342 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:46:48,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-11 04:46:48,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 04:46:48,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-11 04:46:48,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-11 04:46:48,383 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 04:46:48,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-11-11 04:46:48,402 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@51044c23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:46:48,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-11 04:46:48,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:46:48,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:48,746 INFO L85 PathProgramCache]: Analyzing trace with hash 285580101, now seen corresponding path program 1 times [2024-11-11 04:46:48,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:48,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288821328] [2024-11-11 04:46:48,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:48,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:46:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:46:49,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:46:49,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288821328] [2024-11-11 04:46:49,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288821328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:46:49,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:46:49,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-11 04:46:49,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620103091] [2024-11-11 04:46:49,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:46:49,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 04:46:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:46:49,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 04:46:49,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 04:46:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:49,148 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:46:49,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 97.0) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:46:49,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:49,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:49,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 04:46:49,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:46:49,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 412833262, now seen corresponding path program 1 times [2024-11-11 04:46:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:49,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139629949] [2024-11-11 04:46:49,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:46:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:46:50,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:46:50,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139629949] [2024-11-11 04:46:50,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139629949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:46:50,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:46:50,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 04:46:50,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309810537] [2024-11-11 04:46:50,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:46:50,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 04:46:50,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:46:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 04:46:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-11 04:46:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:50,202 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:46:50,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.6) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:46:50,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:50,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:50,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:50,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:50,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 04:46:50,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:46:50,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1239472194, now seen corresponding path program 1 times [2024-11-11 04:46:50,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:50,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847262527] [2024-11-11 04:46:50,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:50,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:46:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:46:50,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:46:50,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847262527] [2024-11-11 04:46:50,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847262527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:46:50,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:46:50,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 04:46:50,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427619831] [2024-11-11 04:46:50,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:46:50,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 04:46:50,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:46:50,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 04:46:50,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 04:46:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:50,693 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:46:50,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:46:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:50,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:50,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:50,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:46:51,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 04:46:51,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:46:51,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash -297222403, now seen corresponding path program 1 times [2024-11-11 04:46:51,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:51,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937939197] [2024-11-11 04:46:51,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:51,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:46:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:46:51,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:46:51,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937939197] [2024-11-11 04:46:51,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937939197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:46:51,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:46:51,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:46:51,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097160524] [2024-11-11 04:46:51,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:46:51,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:46:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:46:51,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:46:51,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:46:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,126 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:46:51,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:46:51,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:51,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:46:51,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:51,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:51,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:46:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:51,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 04:46:51,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:46:51,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:51,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1850501382, now seen corresponding path program 1 times [2024-11-11 04:46:51,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:51,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799122525] [2024-11-11 04:46:51,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:51,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:46:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:46:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:46:51,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799122525] [2024-11-11 04:46:51,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799122525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:46:51,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:46:51,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:46:51,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480826047] [2024-11-11 04:46:51,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:46:51,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:46:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:46:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:46:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:46:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,508 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:46:51,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 60.5) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:46:51,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:51,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:46:51,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:51,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:46:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:51,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 04:46:51,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:46:51,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:51,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1607564305, now seen corresponding path program 1 times [2024-11-11 04:46:51,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:51,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848645737] [2024-11-11 04:46:51,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:46:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:46:51,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:46:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848645737] [2024-11-11 04:46:51,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848645737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:46:51,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:46:51,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:46:51,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681735715] [2024-11-11 04:46:51,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:46:51,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:46:51,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:46:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:46:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:46:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,816 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:46:51,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 66.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:46:51,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:51,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:46:51,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:51,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:51,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:51,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:51,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:46:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:52,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 04:46:52,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:46:52,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1403943961, now seen corresponding path program 1 times [2024-11-11 04:46:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:52,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171842766] [2024-11-11 04:46:52,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:52,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:46:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:46:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:46:52,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171842766] [2024-11-11 04:46:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171842766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:46:52,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:46:52,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:46:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851707026] [2024-11-11 04:46:52,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:46:52,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:46:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:46:52,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:46:52,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:46:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:52,263 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:46:52,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 72.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:46:52,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:52,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:52,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:46:52,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:52,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:52,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:52,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:52,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:52,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:52,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:52,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:52,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:46:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:46:52,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-11-11 04:46:52,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-11 04:46:52,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-11 04:46:52,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-11 04:46:52,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-11 04:46:52,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-11 04:46:52,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-11-11 04:46:52,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-11 04:46:52,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-11 04:46:52,904 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-11 04:46:52,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-11 04:46:52,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-11 04:46:52,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-11 04:46:52,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-11 04:46:52,905 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-11 04:46:52,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 04:46:52,921 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-11 04:46:52,923 INFO L317 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2024-11-11 04:46:52,931 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:46:52,934 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 04:46:52,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-11 04:46:52,935 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@51044c23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:46:52,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 04:46:52,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-11 04:46:52,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:52,994 INFO L85 PathProgramCache]: Analyzing trace with hash 640328589, now seen corresponding path program 1 times [2024-11-11 04:46:52,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318029982] [2024-11-11 04:46:52,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 04:46:53,020 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 04:46:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 04:46:53,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 04:46:53,069 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 04:46:53,069 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-11-11 04:46:53,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 04:46:53,071 INFO L421 BasicCegarLoop]: Path program histogram: [1] [2024-11-11 04:46:53,072 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-11-11 04:46:53,073 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-11 04:46:53,073 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-11 04:46:53,122 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-11 04:46:53,127 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:46:53,128 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 04:46:53,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-11 04:46:53,129 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@51044c23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:46:53,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 04:46:53,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-11 04:46:53,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1740063631, now seen corresponding path program 1 times [2024-11-11 04:46:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:53,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19610867] [2024-11-11 04:46:53,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:53,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 04:46:53,284 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 04:46:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 04:46:53,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 04:46:53,309 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 04:46:53,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-11-11 04:46:53,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 04:46:53,311 INFO L421 BasicCegarLoop]: Path program histogram: [1] [2024-11-11 04:46:53,311 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-11-11 04:46:53,311 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-11 04:46:53,311 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-11 04:46:53,415 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-11 04:46:53,421 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:46:53,426 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 04:46:53,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-11-11 04:46:53,430 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@51044c23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:46:53,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-11 04:46:53,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:46:53,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:53,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1386806139, now seen corresponding path program 1 times [2024-11-11 04:46:53,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:53,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056287736] [2024-11-11 04:46:53,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:46:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:46:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:46:53,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056287736] [2024-11-11 04:46:53,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056287736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:46:53,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:46:53,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-11 04:46:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784520524] [2024-11-11 04:46:53,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:46:53,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 04:46:53,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:46:53,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 04:46:53,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 04:46:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:53,740 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:46:53,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 101.0) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:46:53,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:54,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:54,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 04:46:54,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:46:54,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1949635460, now seen corresponding path program 1 times [2024-11-11 04:46:54,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:54,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399156279] [2024-11-11 04:46:54,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:46:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:46:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:46:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399156279] [2024-11-11 04:46:54,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399156279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:46:54,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:46:54,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 04:46:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338874879] [2024-11-11 04:46:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:46:54,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 04:46:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:46:54,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 04:46:54,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-11 04:46:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:54,492 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:46:54,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.4) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:46:54,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:54,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:54,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:54,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:54,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:54,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:56,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 04:46:56,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:46:56,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:46:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1484069068, now seen corresponding path program 1 times [2024-11-11 04:46:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:46:56,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023926415] [2024-11-11 04:46:56,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:46:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:46:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:46:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:46:56,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:46:56,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023926415] [2024-11-11 04:46:56,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023926415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:46:56,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:46:56,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 04:46:56,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143235334] [2024-11-11 04:46:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:46:56,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 04:46:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:46:56,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 04:46:56,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 04:46:56,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:56,409 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:46:56,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:46:56,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:56,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:46:56,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:46:56,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:56,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:56,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:46:56,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:29,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 04:47:29,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:47:29,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:47:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash -257253549, now seen corresponding path program 1 times [2024-11-11 04:47:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:47:29,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117616267] [2024-11-11 04:47:29,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:47:29,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:47:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:47:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:47:29,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:47:29,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117616267] [2024-11-11 04:47:29,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117616267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:47:29,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:47:29,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:47:29,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686828953] [2024-11-11 04:47:29,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:47:29,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:47:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:47:29,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:47:29,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:47:29,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:29,213 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:47:29,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 59.5) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:47:29,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:29,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:29,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:29,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:29,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:29,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:29,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:29,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:30,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 04:47:30,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:47:30,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:47:30,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1049366204, now seen corresponding path program 1 times [2024-11-11 04:47:30,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:47:30,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110298508] [2024-11-11 04:47:30,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:47:30,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:47:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:47:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:47:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:47:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110298508] [2024-11-11 04:47:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110298508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:47:31,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:47:31,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:47:31,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215474978] [2024-11-11 04:47:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:47:31,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:47:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:47:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:47:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:47:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:31,019 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:47:31,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 62.5) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:47:31,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:31,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:31,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:31,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:31,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:33,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:33,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:33,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:33,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 04:47:33,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:47:33,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:47:33,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1498133088, now seen corresponding path program 1 times [2024-11-11 04:47:33,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:47:33,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569856189] [2024-11-11 04:47:33,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:47:33,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:47:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:47:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:47:33,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:47:33,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569856189] [2024-11-11 04:47:33,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569856189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:47:33,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:47:33,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:47:33,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677593242] [2024-11-11 04:47:33,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:47:33,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:47:33,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:47:33,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:47:33,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:47:33,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:33,402 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:47:33,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 68.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:47:33,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:33,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:33,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:33,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:33,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:33,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:33,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:33,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:33,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:33,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:35,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:35,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 04:47:35,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:47:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:47:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash -341014616, now seen corresponding path program 1 times [2024-11-11 04:47:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:47:35,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736492780] [2024-11-11 04:47:35,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:47:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:47:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:47:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:47:35,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:47:35,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736492780] [2024-11-11 04:47:35,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736492780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:47:35,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:47:35,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:47:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130238611] [2024-11-11 04:47:35,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:47:35,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:47:35,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:47:35,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:47:35,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:47:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:35,442 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:47:35,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 74.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:47:35,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:35,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:35,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:35,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:35,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:35,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:35,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:35,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:35,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:35,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:35,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:37,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 04:47:37,781 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:47:37,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:47:37,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1554654230, now seen corresponding path program 1 times [2024-11-11 04:47:37,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:47:37,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494525022] [2024-11-11 04:47:37,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:47:37,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:47:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:47:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 04:47:38,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:47:38,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494525022] [2024-11-11 04:47:38,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494525022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 04:47:38,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41445093] [2024-11-11 04:47:38,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:47:38,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 04:47:38,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 04:47:38,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 04:47:38,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 04:47:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:47:39,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 04:47:39,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:47:39,301 INFO L378 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-11-11 04:47:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-11 04:47:39,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:47:39,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41445093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:47:39,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 04:47:39,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 04:47:39,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301175611] [2024-11-11 04:47:39,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:47:39,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:47:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:47:39,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:47:39,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 04:47:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:39,397 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:47:39,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:47:39,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:39,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:39,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:39,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:39,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:39,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:39,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:39,398 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:42,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 04:47:42,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 04:47:42,358 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:47:42,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:47:42,359 INFO L85 PathProgramCache]: Analyzing trace with hash -895383346, now seen corresponding path program 2 times [2024-11-11 04:47:42,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:47:42,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260749610] [2024-11-11 04:47:42,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:47:42,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:47:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:47:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-11 04:47:43,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:47:43,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260749610] [2024-11-11 04:47:43,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260749610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:47:43,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:47:43,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 04:47:43,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561688566] [2024-11-11 04:47:43,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:47:43,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 04:47:43,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:47:43,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 04:47:43,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-11 04:47:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:43,653 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:47:43,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:47:43,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:43,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:47:43,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:47:43,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:43,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:43,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:43,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:43,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:47:43,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:47:43,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:43,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:44,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:47:44,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:48:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:48:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:48:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:48:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:48:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:48:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:48:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:48:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:48:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:48:12,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 04:48:12,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:48:12,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:48:12,394 INFO L85 PathProgramCache]: Analyzing trace with hash 572158101, now seen corresponding path program 1 times [2024-11-11 04:48:12,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:48:12,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383326280] [2024-11-11 04:48:12,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:48:12,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:48:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:48:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 04:48:13,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:48:13,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383326280] [2024-11-11 04:48:13,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383326280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 04:48:13,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433339112] [2024-11-11 04:48:13,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:48:13,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 04:48:13,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 04:48:13,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 04:48:13,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 04:48:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:48:13,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 1235 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 04:48:13,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:48:13,788 INFO L378 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 8 treesize of output 1 [2024-11-11 04:48:13,864 INFO L378 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 8 treesize of output 1 [2024-11-11 04:48:13,911 INFO L378 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-11-11 04:48:13,916 INFO L378 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 32 treesize of output 10 [2024-11-11 04:48:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 04:48:13,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 04:48:14,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:48:14,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 164 [2024-11-11 04:48:14,068 INFO L378 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-11-11 04:48:14,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 85 [2024-11-11 04:48:14,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:48:14,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 159 [2024-11-11 04:48:14,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 98 [2024-11-11 04:48:14,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:48:14,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 159 [2024-11-11 04:48:14,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:48:14,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 153 [2024-11-11 04:48:14,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 94 [2024-11-11 04:48:14,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:48:14,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2024-11-11 04:48:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 04:48:14,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433339112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 04:48:14,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 04:48:14,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-11-11 04:48:14,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586298316] [2024-11-11 04:48:14,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 04:48:14,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 04:48:14,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:48:14,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 04:48:14,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-11 04:48:14,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:48:14,682 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:48:14,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 35.46666666666667) internal successors, (532), 15 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:48:14,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:48:14,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:48:14,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:48:14,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:48:14,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:48:14,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:48:14,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:48:14,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:48:14,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:48:14,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:48:14,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:48:14,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:48:16,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:48:16,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:48:37,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:48:37,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:48:37,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:48:37,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:48:44,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:48:44,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:48:44,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:48:44,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:00,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:00,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:00,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:00,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:07,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:07,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:07,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:07,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:23,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:23,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:23,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:23,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:31,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:31,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:31,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:31,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2024-11-11 04:49:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:49:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:49:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:49:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:49:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:49:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:49:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:49:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:49:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:49:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-11 04:49:47,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 04:49:47,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 04:49:47,364 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err10ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:49:47,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:49:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1367334812, now seen corresponding path program 3 times [2024-11-11 04:49:47,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:49:47,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829996149] [2024-11-11 04:49:47,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:49:47,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:49:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:50:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 1074 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:50:20,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:50:20,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829996149] [2024-11-11 04:50:20,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829996149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 04:50:20,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675469166] [2024-11-11 04:50:20,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 04:50:20,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 04:50:20,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 04:50:20,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 04:50:20,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 04:50:21,141 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-11 04:50:21,141 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 04:50:21,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 2520 conjuncts, 168 conjuncts are in the unsatisfiable core [2024-11-11 04:50:21,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:50:21,462 INFO L378 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-11-11 04:50:21,534 INFO L349 Elim1Store]: treesize reduction 30, result has 23.1 percent of original size [2024-11-11 04:50:21,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 144 [2024-11-11 04:50:21,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 122 [2024-11-11 04:50:21,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-11 04:50:21,613 INFO L378 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 8 treesize of output 1 [2024-11-11 04:50:21,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-11-11 04:50:22,055 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-11 04:50:22,056 INFO L378 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 2 case distinctions, treesize of input 124 treesize of output 105 [2024-11-11 04:50:22,253 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,254 INFO L378 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 51 treesize of output 48 [2024-11-11 04:50:22,289 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,290 INFO L378 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 51 treesize of output 48 [2024-11-11 04:50:22,340 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,341 INFO L378 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 51 treesize of output 48 [2024-11-11 04:50:22,489 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,489 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:22,520 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,520 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:22,546 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,546 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:22,573 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,573 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:22,742 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,743 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:22,764 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,765 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:22,794 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,794 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:22,817 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,818 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:22,986 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:22,986 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:23,013 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:23,013 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:23,035 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:23,036 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:23,064 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:23,065 INFO L378 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 28 treesize of output 27 [2024-11-11 04:50:23,756 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-11 04:50:23,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 70 [2024-11-11 04:50:23,933 INFO L349 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2024-11-11 04:50:23,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 178 treesize of output 214 [2024-11-11 04:50:23,967 INFO L349 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2024-11-11 04:50:23,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 166 treesize of output 196 [2024-11-11 04:50:24,098 INFO L378 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 8 treesize of output 1 [2024-11-11 04:50:24,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 6 [2024-11-11 04:50:24,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-11 04:50:24,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2024-11-11 04:50:24,961 INFO L378 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 12 treesize of output 8 [2024-11-11 04:50:25,236 INFO L378 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 12 treesize of output 8 [2024-11-11 04:50:25,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2024-11-11 04:50:25,495 INFO L378 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 12 treesize of output 8 [2024-11-11 04:50:25,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-11 04:50:25,893 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-11 04:50:25,893 INFO L378 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 2 case distinctions, treesize of input 61 treesize of output 54 [2024-11-11 04:50:26,016 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,016 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,035 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,036 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,062 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,062 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,210 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,210 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,253 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,253 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,279 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,280 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,317 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,318 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,635 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,636 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,657 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,657 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,685 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,685 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,709 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,710 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,948 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,949 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,971 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,971 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:26,997 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:26,997 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:27,021 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:27,022 INFO L378 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 28 treesize of output 25 [2024-11-11 04:50:27,935 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-11 04:50:27,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 87 [2024-11-11 04:50:28,117 INFO L349 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2024-11-11 04:50:28,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 200 treesize of output 224 [2024-11-11 04:50:28,158 INFO L349 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2024-11-11 04:50:28,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 175 treesize of output 211 [2024-11-11 04:50:28,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-11 04:50:28,370 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:28,370 INFO L378 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 18 treesize of output 17 [2024-11-11 04:50:28,478 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:28,479 INFO L378 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 117 treesize of output 114 [2024-11-11 04:50:28,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2024-11-11 04:50:28,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2024-11-11 04:50:28,824 INFO L378 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 12 treesize of output 8 [2024-11-11 04:50:28,870 INFO L378 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 12 treesize of output 8 [2024-11-11 04:50:28,891 INFO L378 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 12 treesize of output 8 [2024-11-11 04:50:28,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 88 [2024-11-11 04:50:29,162 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-11 04:50:29,162 INFO L378 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 2 case distinctions, treesize of input 77 treesize of output 68 [2024-11-11 04:50:29,295 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:29,295 INFO L378 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 44 treesize of output 39 [2024-11-11 04:50:29,326 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:29,326 INFO L378 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 44 treesize of output 39 [2024-11-11 04:50:29,355 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:29,356 INFO L378 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 44 treesize of output 39 [2024-11-11 04:50:29,526 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:29,526 INFO L378 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 44 treesize of output 39 [2024-11-11 04:50:29,554 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:29,555 INFO L378 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 44 treesize of output 39 [2024-11-11 04:50:29,588 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:29,588 INFO L378 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 44 treesize of output 39 [2024-11-11 04:50:29,617 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:29,618 INFO L378 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 44 treesize of output 39 [2024-11-11 04:50:29,940 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:29,940 INFO L378 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 44 treesize of output 39 [2024-11-11 04:50:29,975 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:29,975 INFO L378 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 44 treesize of output 39 [2024-11-11 04:50:30,007 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:30,007 INFO L378 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 44 treesize of output 39 [2024-11-11 04:50:30,036 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:30,036 INFO L378 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 44 treesize of output 39 [2024-11-11 04:50:30,437 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-11 04:50:30,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 50 [2024-11-11 04:50:30,465 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-11 04:50:30,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 50 [2024-11-11 04:50:30,500 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-11 04:50:30,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 46 [2024-11-11 04:50:30,521 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-11 04:50:30,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 53 [2024-11-11 04:50:31,879 INFO L349 Elim1Store]: treesize reduction 40, result has 28.6 percent of original size [2024-11-11 04:50:31,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 122 treesize of output 131 [2024-11-11 04:50:32,196 INFO L349 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2024-11-11 04:50:32,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 244 [2024-11-11 04:50:32,239 INFO L349 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2024-11-11 04:50:32,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 195 treesize of output 231 [2024-11-11 04:50:32,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-11 04:50:32,534 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:32,534 INFO L378 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 18 treesize of output 17 [2024-11-11 04:50:32,575 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:32,575 INFO L378 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 193 treesize of output 184 [2024-11-11 04:50:32,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-11 04:50:32,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-11 04:50:32,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 04:50:32,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-11 04:50:33,183 INFO L378 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 12 treesize of output 8 [2024-11-11 04:50:33,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-11 04:50:33,540 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-11 04:50:33,540 INFO L378 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 2 case distinctions, treesize of input 84 treesize of output 73 [2024-11-11 04:50:33,670 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:33,670 INFO L378 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 51 treesize of output 44 [2024-11-11 04:50:33,698 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:33,698 INFO L378 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 51 treesize of output 44 [2024-11-11 04:50:33,729 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:33,729 INFO L378 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 51 treesize of output 44 [2024-11-11 04:50:33,904 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:33,904 INFO L378 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 51 treesize of output 44 [2024-11-11 04:50:33,933 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:33,934 INFO L378 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 51 treesize of output 44 [2024-11-11 04:50:33,963 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:33,963 INFO L378 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 51 treesize of output 44 [2024-11-11 04:50:33,993 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:33,993 INFO L378 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 51 treesize of output 44 [2024-11-11 04:50:34,380 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:34,381 INFO L378 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 51 treesize of output 44 [2024-11-11 04:50:34,411 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:34,412 INFO L378 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 51 treesize of output 44 [2024-11-11 04:50:34,440 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:34,440 INFO L378 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 51 treesize of output 44 [2024-11-11 04:50:34,468 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:34,468 INFO L378 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 51 treesize of output 44 [2024-11-11 04:50:34,653 INFO L378 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 16 treesize of output 8 [2024-11-11 04:50:34,750 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:34,751 INFO L378 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 42 treesize of output 35 [2024-11-11 04:50:34,775 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:34,775 INFO L378 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 42 treesize of output 35 [2024-11-11 04:50:34,796 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:34,797 INFO L378 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 42 treesize of output 35 [2024-11-11 04:50:34,820 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-11 04:50:34,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 57 [2024-11-11 04:50:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2024-11-11 04:50:35,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:50:35,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675469166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:50:35,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 04:50:35,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [45] total 92 [2024-11-11 04:50:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874029337] [2024-11-11 04:50:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:50:35,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-11 04:50:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:50:35,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-11 04:50:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=7995, Unknown=0, NotChecked=0, Total=8372 [2024-11-11 04:50:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:35,259 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:50:35,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 13.354166666666666) internal successors, (641), 48 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:50:35,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:35,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:35,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:50:35,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:35,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:35,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:35,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:35,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:35,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:35,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-11 04:50:35,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:35,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:50:35,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:50:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:50:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-11 04:50:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:50:42,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 04:50:42,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 04:50:42,465 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:50:42,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:50:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1866728452, now seen corresponding path program 1 times [2024-11-11 04:50:42,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:50:42,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319955434] [2024-11-11 04:50:42,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:50:42,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:50:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:50:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2024-11-11 04:50:42,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:50:42,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319955434] [2024-11-11 04:50:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319955434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:50:42,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:50:42,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 04:50:42,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678901219] [2024-11-11 04:50:42,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:50:42,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 04:50:42,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:50:42,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 04:50:42,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 04:50:42,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:42,821 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:50:42,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:50:42,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:42,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:42,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:50:42,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:42,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:42,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:42,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:42,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:42,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:42,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-11 04:50:42,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:50:42,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:50:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-11 04:50:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:50:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:50:45,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 04:50:45,616 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:50:45,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:50:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash -888956417, now seen corresponding path program 1 times [2024-11-11 04:50:45,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:50:45,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125926263] [2024-11-11 04:50:45,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:50:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:50:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:50:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2024-11-11 04:50:45,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:50:45,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125926263] [2024-11-11 04:50:45,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125926263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:50:45,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:50:45,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 04:50:45,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152277931] [2024-11-11 04:50:45,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:50:45,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 04:50:45,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:50:45,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 04:50:45,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 04:50:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:45,944 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:50:45,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:50:45,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:45,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:45,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:50:45,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:45,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:45,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:45,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:45,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:45,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:45,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-11 04:50:45,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:50:45,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:50:45,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:45,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:50:45,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:50:45,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:50:46,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:50:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:50:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:50:48,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 04:50:48,980 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:50:48,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:50:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash -337126465, now seen corresponding path program 1 times [2024-11-11 04:50:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 04:50:48,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868270375] [2024-11-11 04:50:48,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:50:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 04:50:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:50:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:50:52,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 04:50:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868270375] [2024-11-11 04:50:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868270375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 04:50:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199476360] [2024-11-11 04:50:52,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:50:52,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 04:50:52,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 04:50:52,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 04:50:52,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 04:50:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:50:53,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 2053 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-11 04:50:53,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:50:53,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:50:53,451 INFO L378 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 32 treesize of output 10 [2024-11-11 04:50:53,453 INFO L378 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-11-11 04:50:53,695 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 04:50:53,695 INFO L378 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 16 treesize of output 15 [2024-11-11 04:50:53,766 INFO L378 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 8 treesize of output 1 [2024-11-11 04:50:53,834 INFO L378 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 8 treesize of output 1 [2024-11-11 04:50:53,902 INFO L378 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 8 treesize of output 1 [2024-11-11 04:50:53,996 INFO L378 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 8 treesize of output 1 [2024-11-11 04:50:54,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-11 04:50:54,114 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-11 04:50:54,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-11 04:50:54,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-11 04:50:54,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2024-11-11 04:50:54,446 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 04:50:54,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-11 04:50:54,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:50:54,472 INFO L378 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 32 treesize of output 10 [2024-11-11 04:50:54,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-11 04:50:54,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-11 04:50:54,589 INFO L378 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-11-11 04:50:54,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:50:54,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-11 04:50:54,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:50:54,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-11 04:50:54,715 INFO L378 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 43 treesize of output 32 [2024-11-11 04:51:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:51:00,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 04:51:02,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse3 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse5 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (and (or (< 64 c_~next_alloc_idx~0) (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse1 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse0) 0) (not (= .cse1 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse1)) (not (= .cse1 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= .cse2 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse2)) (not (= .cse2 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse3) 0)))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= .cse4 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse4)) (not (= .cse4 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse5) 0)))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= .cse6 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse6)) (not (= .cse6 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))))) (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse7)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse7)) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse0) 0) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse7))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse3) 0) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse8)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse8)) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse8))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse9)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse9)) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse5) 0) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse9))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse10)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse10)) (= (select (select (store |c_#race| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse10)))))) (< c_~next_alloc_idx~0 65)))) is different from false [2024-11-11 04:51:03,153 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse6 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse1 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse4 0))) (.cse2 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (and (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= .cse0 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse0)) (not (= .cse0 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (= 0 (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse2)) (not (= .cse3 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse3)) (not (= .cse3 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse5 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse4) 0) (not (= .cse5 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse5)) (not (= .cse5 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse7 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse6) 0) (not (= .cse7 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse7)) (not (= .cse7 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))))))) (< 64 c_~next_alloc_idx~0)) (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse8)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse8)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse4) 0) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse8))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse9)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse9)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse6) 0) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse9))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse10)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse10)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse10))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse11 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse11)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse2) 0) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse11)) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse11)))))) (< c_~next_alloc_idx~0 65))))) is different from false [2024-11-11 04:51:03,520 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse3 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (store (select |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7 0) .cse3 0))) (.cse2 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1))) (and (or (< c_~next_alloc_idx~0 65) (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse0)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse2) 0) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse0)) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse0))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse3) 0) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse4)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse4)) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse4))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse5 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse5)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse5)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse5))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse6)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse6)) (= 0 (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7)) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse6))))))) (or (< 64 c_~next_alloc_idx~0) (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= .cse8 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse8)) (not (= .cse8 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= .cse9 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse9)) (not (= .cse9 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse3) 0)))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= .cse10 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse10)) (not (= .cse10 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse11 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse2) 0) (not (= .cse11 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse11)) (not (= .cse11 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))))))))))) is different from false [2024-11-11 04:51:05,611 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| 1)) (.cse7 (+ 2 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse2 (+ 3 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (let ((.cse1 (store |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (store (store (select |c_#race| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse5 0) .cse7 0) .cse2 0)))) (and (or (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse0 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse0)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse0)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse2) 0) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse0))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse3 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse3)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse3)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse3))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse4 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse4)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse4)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse5) 0) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse4))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_27 (Array Int Int))) (let ((.cse6 (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse6)) (not (= (select v_DerPreprocessor_27 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)) .cse6)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_27) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= (select v_DerPreprocessor_27 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) .cse6)))))) (< c_~next_alloc_idx~0 65)) (or (< 64 c_~next_alloc_idx~0) (and (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= .cse8 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse8)) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0) (not (= .cse8 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= .cse9 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse5) 0) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse9)) (not (= .cse9 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse10 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (not (= .cse10 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse2) 0) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse10)) (not (= .cse10 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3))))))) (forall ((|thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| Int) (v_DerPreprocessor_26 (Array Int Int))) (let ((.cse11 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 1)))) (or (= (select (select (store .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_26) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) .cse7) 0) (not (= .cse11 (select v_DerPreprocessor_26 |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 2)) .cse11)) (not (= .cse11 (select v_DerPreprocessor_26 (+ |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 3)))))))))))) is different from false [2024-11-11 04:51:05,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:51:05,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51 [2024-11-11 04:51:05,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:51:05,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36 [2024-11-11 04:51:05,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:51:05,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 54 [2024-11-11 04:51:05,721 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-11 04:51:05,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2024-11-11 04:51:05,729 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-11 04:51:05,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2024-11-11 04:51:05,735 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-11 04:51:05,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2024-11-11 04:51:05,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:51:05,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51 [2024-11-11 04:51:05,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:51:05,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36 [2024-11-11 04:51:05,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:51:05,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 54 [2024-11-11 04:51:05,805 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-11 04:51:05,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2024-11-11 04:51:05,813 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-11 04:51:05,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1 [2024-11-11 04:51:05,820 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2024-11-11 04:51:05,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1 [2024-11-11 04:51:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 1026 trivial. 4 not checked. [2024-11-11 04:51:06,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199476360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 04:51:06,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 04:51:06,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 10] total 48 [2024-11-11 04:51:06,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865797187] [2024-11-11 04:51:06,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 04:51:06,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-11 04:51:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 04:51:06,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-11 04:51:06,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1723, Unknown=7, NotChecked=356, Total=2352 [2024-11-11 04:51:06,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:51:06,206 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:51:06,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 28.3125) internal successors, (1359), 49 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:51:06,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:51:06,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:51:06,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:51:06,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:51:06,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:51:06,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:51:06,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:51:06,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:51:06,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:51:06,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-11 04:51:06,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:51:06,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:51:06,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:51:06,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:51:08,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:12,658 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 [0] [2024-11-11 04:51:14,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:16,722 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 [0] [2024-11-11 04:51:18,737 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 [0] [2024-11-11 04:51:20,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:24,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:26,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:28,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:30,908 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 [0] [2024-11-11 04:51:32,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:34,961 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 [0] [2024-11-11 04:51:36,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:39,012 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 [0] [2024-11-11 04:51:41,034 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 [0] [2024-11-11 04:51:43,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:45,079 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 [0] [2024-11-11 04:51:47,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:49,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:51,170 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 [0] [2024-11-11 04:51:53,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:51:55,204 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 [0] [2024-11-11 04:51:57,218 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 [0] [2024-11-11 04:51:59,232 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 [0] [2024-11-11 04:52:01,248 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 [0] [2024-11-11 04:52:03,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:05,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:07,302 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 [0] [2024-11-11 04:52:09,325 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 [0] [2024-11-11 04:52:11,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:13,390 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 [0] [2024-11-11 04:52:15,412 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 [0] [2024-11-11 04:52:17,439 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 [0] [2024-11-11 04:52:19,468 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 [0] [2024-11-11 04:52:21,488 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 [0] [2024-11-11 04:52:23,503 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 [0] [2024-11-11 04:52:25,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:27,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:29,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:31,671 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 [0] [2024-11-11 04:52:33,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:35,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:37,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:39,781 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 [0] [2024-11-11 04:52:41,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:43,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:45,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:47,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:49,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:52,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:54,054 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 [0] [2024-11-11 04:52:56,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:52:58,097 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 [0] [2024-11-11 04:53:00,111 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 [0] [2024-11-11 04:53:02,135 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 [0] [2024-11-11 04:53:04,156 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 [0] [2024-11-11 04:53:06,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:53:10,260 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 [0] [2024-11-11 04:53:12,269 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 [0] [2024-11-11 04:53:14,277 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 [0] [2024-11-11 04:53:16,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:53:20,491 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 [0] [2024-11-11 04:53:22,508 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 [0] [2024-11-11 04:53:24,522 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 [0] [2024-11-11 04:53:26,536 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 [0] [2024-11-11 04:53:28,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:53:30,572 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 [0] [2024-11-11 04:53:32,586 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 [0] [2024-11-11 04:53:34,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:53:36,616 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 [0] [2024-11-11 04:53:38,633 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 [0] [2024-11-11 04:53:40,648 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 [0] [2024-11-11 04:53:42,660 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 [0] [2024-11-11 04:53:44,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:53:46,693 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 [0] [2024-11-11 04:53:48,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:53:50,728 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 [0] [2024-11-11 04:53:52,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:53:54,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:53:56,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:53:58,876 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 [0] [2024-11-11 04:54:00,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:02,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:05,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:09,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:11,148 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 [0] [2024-11-11 04:54:13,219 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 [0] [2024-11-11 04:54:19,286 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 [0] [2024-11-11 04:54:21,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:23,338 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 [0] [2024-11-11 04:54:25,361 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 [0] [2024-11-11 04:54:27,369 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 [0] [2024-11-11 04:54:29,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:31,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:33,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:35,523 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 [0] [2024-11-11 04:54:37,538 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 [0] [2024-11-11 04:54:40,384 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 [0] [2024-11-11 04:54:42,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:44,500 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 [0] [2024-11-11 04:54:46,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:48,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:50,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:52,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:54:54,683 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 [0] [2024-11-11 04:54:56,706 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 [0] [2024-11-11 04:54:58,719 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 [0] [2024-11-11 04:55:05,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:11,230 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 [0] [2024-11-11 04:55:13,246 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 [0] [2024-11-11 04:55:15,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:17,298 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 [0] [2024-11-11 04:55:19,315 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 [0] [2024-11-11 04:55:21,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:23,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:25,399 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 [0] [2024-11-11 04:55:27,418 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 [0] [2024-11-11 04:55:29,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:31,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:33,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:35,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:37,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:39,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:41,980 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 [0] [2024-11-11 04:55:44,004 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 [0] [2024-11-11 04:55:46,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:48,047 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 [0] [2024-11-11 04:55:50,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:55:56,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:02,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 [0] [2024-11-11 04:56:04,510 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 [0] [2024-11-11 04:56:06,521 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 [0] [2024-11-11 04:56:08,532 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 [0] [2024-11-11 04:56:10,553 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 [0] [2024-11-11 04:56:12,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:14,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:16,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:18,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:20,710 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 [0] [2024-11-11 04:56:22,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:25,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:27,050 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 [0] [2024-11-11 04:56:29,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:31,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:33,160 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 [0] [2024-11-11 04:56:35,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:37,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:39,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:41,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:47,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:53,639 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 [0] [2024-11-11 04:56:55,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:57,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:56:59,725 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 [0] [2024-11-11 04:57:01,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:57:03,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:57:05,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-11 04:57:07,848 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 [0] [2024-11-11 04:57:09,867 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 [0] [2024-11-11 04:57:11,272 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-11 04:57:11,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-11-11 04:57:11,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 04:57:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-11 04:57:11,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-11-11 04:57:11,534 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:680) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:145) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$BasicTraversal.traverse(PartialOrderReductionFacade.java:345) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$PersistentSetTraversal.traverse(PartialOrderReductionFacade.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepSetTraversal.traverse(PartialOrderReductionFacade.java:380) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:442) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 55 more [2024-11-11 04:57:11,539 INFO L158 Benchmark]: Toolchain (without parser) took 624689.23ms. Allocated memory was 174.1MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 104.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-11-11 04:57:11,539 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 04:57:11,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.74ms. Allocated memory is still 174.1MB. Free memory was 104.5MB in the beginning and 81.2MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-11 04:57:11,540 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.19ms. Allocated memory is still 174.1MB. Free memory was 81.2MB in the beginning and 144.7MB in the end (delta: -63.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-11-11 04:57:11,540 INFO L158 Benchmark]: Boogie Preprocessor took 65.46ms. Allocated memory is still 174.1MB. Free memory was 144.7MB in the beginning and 141.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 04:57:11,540 INFO L158 Benchmark]: RCFGBuilder took 662.41ms. Allocated memory is still 174.1MB. Free memory was 141.7MB in the beginning and 109.0MB in the end (delta: 32.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-11 04:57:11,540 INFO L158 Benchmark]: TraceAbstraction took 623358.79ms. Allocated memory was 174.1MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 108.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-11-11 04:57:11,540 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.74ms. Allocated memory is still 174.1MB. Free memory was 104.5MB in the beginning and 81.2MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.19ms. Allocated memory is still 174.1MB. Free memory was 81.2MB in the beginning and 144.7MB in the end (delta: -63.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.46ms. Allocated memory is still 174.1MB. Free memory was 144.7MB in the beginning and 141.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 662.41ms. Allocated memory is still 174.1MB. Free memory was 141.7MB in the beginning and 109.0MB in the end (delta: 32.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 623358.79ms. Allocated memory was 174.1MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 108.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 479, independent: 454, independent conditional: 17, independent unconditional: 437, dependent: 25, dependent conditional: 24, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 340, Positive conditional cache size: 0, Positive unconditional cache size: 340, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0, Independence queries for same thread: 24, Statistics for Abstraction: , Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 97, Number of trivial persistent sets: 89, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 438, independent: 437, independent conditional: 0, independent unconditional: 437, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 479, independent: 454, independent conditional: 17, independent unconditional: 437, dependent: 25, dependent conditional: 24, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 340, Positive conditional cache size: 0, Positive unconditional cache size: 340, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0, Independence queries for same thread: 24, Statistics for Abstraction: , Independence relation #2 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 566, independent: 557, independent conditional: 24, independent unconditional: 533, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 436, Positive conditional cache size: 0, Positive unconditional cache size: 436, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0, Independence queries for same thread: 31, Statistics for Abstraction: , Persistent sets #2 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 103, Number of trivial persistent sets: 90, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 535, independent: 533, independent conditional: 0, independent unconditional: 533, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 566, independent: 557, independent conditional: 24, independent unconditional: 533, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 436, Positive conditional cache size: 0, Positive unconditional cache size: 436, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0, Independence queries for same thread: 31, Statistics for Abstraction: , Independence relation #3 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 837, independent: 818, independent conditional: 42, independent unconditional: 776, dependent: 19, dependent conditional: 10, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 917, Positive cache size: 906, Positive conditional cache size: 0, Positive unconditional cache size: 906, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 83, Maximal queried relation: 0, Independence queries for same thread: 41, Statistics for Abstraction: , Persistent sets #3 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 118, Number of trivial persistent sets: 97, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 785, independent: 776, independent conditional: 0, independent unconditional: 776, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 837, independent: 818, independent conditional: 42, independent unconditional: 776, dependent: 19, dependent conditional: 10, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 917, Positive cache size: 906, Positive conditional cache size: 0, Positive unconditional cache size: 906, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 83, Maximal queried relation: 0, Independence queries for same thread: 41, Statistics for Abstraction: , Independence relation #4 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1624, independent: 1598, independent conditional: 58, independent unconditional: 1540, dependent: 26, dependent conditional: 10, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 1916, Positive cache size: 1889, Positive conditional cache size: 0, Positive unconditional cache size: 1889, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 141, Maximal queried relation: 0, Independence queries for same thread: 51, Statistics for Abstraction: , Persistent sets #4 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 128, Number of trivial persistent sets: 110, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1556, independent: 1540, independent conditional: 0, independent unconditional: 1540, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1624, independent: 1598, independent conditional: 58, independent unconditional: 1540, dependent: 26, dependent conditional: 10, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 1916, Positive cache size: 1889, Positive conditional cache size: 0, Positive unconditional cache size: 1889, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 141, Maximal queried relation: 0, Independence queries for same thread: 51, Statistics for Abstraction: , Independence relation #5 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1730, independent: 1702, independent conditional: 65, independent unconditional: 1637, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 2251, Positive cache size: 2207, Positive conditional cache size: 0, Positive unconditional cache size: 2207, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 206, Maximal queried relation: 0, Independence queries for same thread: 62, Statistics for Abstraction: , Persistent sets #5 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 134, Number of trivial persistent sets: 111, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1654, independent: 1637, independent conditional: 0, independent unconditional: 1637, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1730, independent: 1702, independent conditional: 65, independent unconditional: 1637, dependent: 28, dependent conditional: 11, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 2251, Positive cache size: 2207, Positive conditional cache size: 0, Positive unconditional cache size: 2207, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 206, Maximal queried relation: 0, Independence queries for same thread: 62, Statistics for Abstraction: , Independence relation #6 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1925, independent: 1888, independent conditional: 78, independent unconditional: 1810, dependent: 37, dependent conditional: 13, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 2545, Positive cache size: 2494, Positive conditional cache size: 0, Positive unconditional cache size: 2494, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 284, Maximal queried relation: 0, Independence queries for same thread: 75, Statistics for Abstraction: , Persistent sets #6 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 145, Number of trivial persistent sets: 118, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1834, independent: 1810, independent conditional: 0, independent unconditional: 1810, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 1925, independent: 1888, independent conditional: 78, independent unconditional: 1810, dependent: 37, dependent conditional: 13, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 2545, Positive cache size: 2494, Positive conditional cache size: 0, Positive unconditional cache size: 2494, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 284, Maximal queried relation: 0, Independence queries for same thread: 75, Statistics for Abstraction: , Independence relation #7 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 2135, independent: 2089, independent conditional: 92, independent unconditional: 1997, dependent: 46, dependent conditional: 15, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 2970, Positive cache size: 2888, Positive conditional cache size: 0, Positive unconditional cache size: 2888, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 376, Maximal queried relation: 0, Independence queries for same thread: 90, Statistics for Abstraction: , Persistent sets #7 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 157, Number of trivial persistent sets: 125, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2028, independent: 1997, independent conditional: 0, independent unconditional: 1997, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 2135, independent: 2089, independent conditional: 92, independent unconditional: 1997, dependent: 46, dependent conditional: 15, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 2970, Positive cache size: 2888, Positive conditional cache size: 0, Positive unconditional cache size: 2888, Negative cache size: 82, Negative conditional cache size: 0, Negative unconditional cache size: 82, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 376, Maximal queried relation: 0, Independence queries for same thread: 90, Statistics for Abstraction: , Independence relation #8 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 4203, independent: 4115, independent conditional: 579, independent unconditional: 3536, dependent: 88, dependent conditional: 28, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 3467, Positive cache size: 3325, Positive conditional cache size: 0, Positive unconditional cache size: 3325, Negative cache size: 142, Negative conditional cache size: 0, Negative unconditional cache size: 142, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 955, Maximal queried relation: 0, Independence queries for same thread: 118, Statistics for Abstraction: , Persistent sets #8 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 374, Number of trivial persistent sets: 328, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3596, independent: 3536, independent conditional: 0, independent unconditional: 3536, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 4203, independent: 4115, independent conditional: 579, independent unconditional: 3536, dependent: 88, dependent conditional: 28, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 13499, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 278, dependent conditional: 118, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 955, independent unconditional: 12266, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13381, independent: 13221, independent conditional: 0, independent unconditional: 13221, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3467, independent: 3325, independent conditional: 0, independent unconditional: 3325, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3467, independent: 3294, independent conditional: 0, independent unconditional: 3294, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 173, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1550, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 1115, dependent conditional: 0, dependent unconditional: 1115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13381, independent: 9896, independent conditional: 0, independent unconditional: 9896, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 3467, unknown conditional: 0, unknown unconditional: 3467] , Statistics on independence cache: Total cache size (in pairs): 3467, Positive cache size: 3325, Positive conditional cache size: 0, Positive unconditional cache size: 3325, Negative cache size: 142, Negative conditional cache size: 0, Negative unconditional cache size: 142, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 955, Maximal queried relation: 0, Independence queries for same thread: 118, Statistics for Abstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 891, independent: 890, independent conditional: 7, independent unconditional: 883, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 891, independent: 890, independent conditional: 7, independent unconditional: 883, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 891, independent: 890, independent conditional: 7, independent unconditional: 883, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 891, independent: 890, independent conditional: 7, independent unconditional: 883, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 891, independent: 890, independent conditional: 7, independent unconditional: 883, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 891, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 891, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 874, independent: 873, independent conditional: 0, independent unconditional: 873, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 874, independent: 873, independent conditional: 0, independent unconditional: 873, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 891, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 874, unknown conditional: 0, unknown unconditional: 874] , Statistics on independence cache: Total cache size (in pairs): 4341, Positive cache size: 4198, Positive conditional cache size: 0, Positive unconditional cache size: 4198, Negative cache size: 143, Negative conditional cache size: 0, Negative unconditional cache size: 143, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0, Independence queries for same thread: 0, Statistics for Abstraction: , Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 95, Number of trivial persistent sets: 89, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 884, independent: 883, independent conditional: 0, independent unconditional: 883, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 891, independent: 890, independent conditional: 7, independent unconditional: 883, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 891, independent: 890, independent conditional: 7, independent unconditional: 883, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 891, independent: 890, independent conditional: 7, independent unconditional: 883, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 891, independent: 890, independent conditional: 7, independent unconditional: 883, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 891, independent: 890, independent conditional: 7, independent unconditional: 883, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 891, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 891, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 874, independent: 873, independent conditional: 0, independent unconditional: 873, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 874, independent: 873, independent conditional: 0, independent unconditional: 873, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 891, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 874, unknown conditional: 0, unknown unconditional: 874] , Statistics on independence cache: Total cache size (in pairs): 4341, Positive cache size: 4198, Positive conditional cache size: 0, Positive unconditional cache size: 4198, Negative cache size: 143, Negative conditional cache size: 0, Negative unconditional cache size: 143, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: IndependenceRelationWithAbstraction.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 32, independent unconditional: 1999, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 32, independent unconditional: 1999, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 32, independent unconditional: 1999, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 32, independent unconditional: 1999, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 32, independent unconditional: 1999, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 0, independent unconditional: 2031, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 0, independent unconditional: 2031, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1979, independent: 1977, independent conditional: 0, independent unconditional: 1977, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1979, independent: 1977, independent conditional: 0, independent unconditional: 1977, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2033, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1979, unknown conditional: 0, unknown unconditional: 1979] , Statistics on independence cache: Total cache size (in pairs): 6320, Positive cache size: 6175, Positive conditional cache size: 0, Positive unconditional cache size: 6175, Negative cache size: 145, Negative conditional cache size: 0, Negative unconditional cache size: 145, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0, Independence queries for same thread: 0, Statistics for Abstraction: , Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 102, Number of trivial persistent sets: 90, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2001, independent: 1999, independent conditional: 0, independent unconditional: 1999, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 32, independent unconditional: 1999, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 32, independent unconditional: 1999, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 32, independent unconditional: 1999, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 32, independent unconditional: 1999, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 32, independent unconditional: 1999, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 0, independent unconditional: 2031, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2033, independent: 2031, independent conditional: 0, independent unconditional: 2031, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1979, independent: 1977, independent conditional: 0, independent unconditional: 1977, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1979, independent: 1977, independent conditional: 0, independent unconditional: 1977, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2033, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1979, unknown conditional: 0, unknown unconditional: 1979] , Statistics on independence cache: Total cache size (in pairs): 6320, Positive cache size: 6175, Positive conditional cache size: 0, Positive unconditional cache size: 6175, Negative cache size: 145, Negative conditional cache size: 0, Negative unconditional cache size: 145, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0, Independence queries for same thread: 0, Statistics for Abstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-race.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d76df1bfaca9781352b9c7afbe4683f5e649e880008edad8122f422eebb0dbe8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 04:57:14,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 04:57:14,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Bitvector.epf [2024-11-11 04:57:14,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 04:57:14,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 04:57:14,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 04:57:14,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 04:57:14,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 04:57:14,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 04:57:14,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 04:57:14,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 04:57:14,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 04:57:14,243 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 04:57:14,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 04:57:14,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 04:57:14,244 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 04:57:14,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 04:57:14,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 04:57:14,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 04:57:14,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 04:57:14,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 04:57:14,247 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-11 04:57:14,247 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 04:57:14,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 04:57:14,248 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 04:57:14,249 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-11 04:57:14,249 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 04:57:14,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 04:57:14,250 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 04:57:14,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 04:57:14,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 04:57:14,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 04:57:14,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 04:57:14,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 04:57:14,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 04:57:14,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 04:57:14,253 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 04:57:14,253 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 04:57:14,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 04:57:14,254 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-11 04:57:14,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-11 04:57:14,255 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-11 04:57:14,255 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-11 04:57:14,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> GemCutter 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 -> d76df1bfaca9781352b9c7afbe4683f5e649e880008edad8122f422eebb0dbe8 [2024-11-11 04:57:14,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 04:57:14,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 04:57:14,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 04:57:14,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 04:57:14,638 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 04:57:14,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-race.i [2024-11-11 04:57:16,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 04:57:16,514 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 04:57:16,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur-race.i [2024-11-11 04:57:16,532 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f74c634e7/5c5b1f6dc77948f896e894d46e58a815/FLAG385cbb543 [2024-11-11 04:57:16,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f74c634e7/5c5b1f6dc77948f896e894d46e58a815 [2024-11-11 04:57:16,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 04:57:16,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 04:57:16,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 04:57:16,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 04:57:16,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 04:57:16,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:57:16" (1/1) ... [2024-11-11 04:57:16,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de2dcf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:16, skipping insertion in model container [2024-11-11 04:57:16,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:57:16" (1/1) ... [2024-11-11 04:57:16,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 04:57:17,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 04:57:17,052 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 04:57:17,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 04:57:17,166 INFO L204 MainTranslator]: Completed translation [2024-11-11 04:57:17,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17 WrapperNode [2024-11-11 04:57:17,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 04:57:17,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 04:57:17,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 04:57:17,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 04:57:17,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (1/1) ... [2024-11-11 04:57:17,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (1/1) ... [2024-11-11 04:57:17,248 INFO L138 Inliner]: procedures = 169, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 202 [2024-11-11 04:57:17,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 04:57:17,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 04:57:17,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 04:57:17,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 04:57:17,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (1/1) ... [2024-11-11 04:57:17,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (1/1) ... [2024-11-11 04:57:17,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (1/1) ... [2024-11-11 04:57:17,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (1/1) ... [2024-11-11 04:57:17,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (1/1) ... [2024-11-11 04:57:17,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (1/1) ... [2024-11-11 04:57:17,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (1/1) ... [2024-11-11 04:57:17,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (1/1) ... [2024-11-11 04:57:17,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 04:57:17,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 04:57:17,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 04:57:17,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 04:57:17,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (1/1) ... [2024-11-11 04:57:17,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 04:57:17,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 04:57:17,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-11 04:57:17,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-11 04:57:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-11 04:57:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-11 04:57:17,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-11 04:57:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-11 04:57:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 04:57:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 04:57:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 04:57:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-11 04:57:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-11 04:57:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-11 04:57:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-11 04:57:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 04:57:17,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 04:57:17,408 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-11 04:57:17,554 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 04:57:17,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 04:57:18,027 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-11 04:57:18,027 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 04:57:18,158 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 04:57:18,162 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 04:57:18,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:57:18 BoogieIcfgContainer [2024-11-11 04:57:18,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 04:57:18,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 04:57:18,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 04:57:18,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 04:57:18,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:57:16" (1/3) ... [2024-11-11 04:57:18,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fa84c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:57:18, skipping insertion in model container [2024-11-11 04:57:18,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:57:17" (2/3) ... [2024-11-11 04:57:18,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fa84c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:57:18, skipping insertion in model container [2024-11-11 04:57:18,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:57:18" (3/3) ... [2024-11-11 04:57:18,175 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-race.i [2024-11-11 04:57:18,193 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 04:57:18,193 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-11 04:57:18,193 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-11 04:57:18,309 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-11 04:57:18,376 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:57:18,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-11 04:57:18,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 04:57:18,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-11 04:57:18,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-11 04:57:18,422 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 04:57:18,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-11-11 04:57:18,450 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5b443387, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:57:18,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-11 04:57:18,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:18,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:18,839 INFO L85 PathProgramCache]: Analyzing trace with hash 315566268, now seen corresponding path program 1 times [2024-11-11 04:57:18,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374966427] [2024-11-11 04:57:18,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:18,850 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:18,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:18,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:18,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-11 04:57:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:19,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 04:57:19,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:19,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:19,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374966427] [2024-11-11 04:57:19,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374966427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:19,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:19,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-11 04:57:19,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941862757] [2024-11-11 04:57:19,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:19,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 04:57:19,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:19,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 04:57:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 04:57:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:19,107 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:19,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 98.0) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:19,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:19,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:19,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-11 04:57:19,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:19,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:19,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1221820133, now seen corresponding path program 1 times [2024-11-11 04:57:19,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:19,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021326886] [2024-11-11 04:57:19,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:19,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:19,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:19,425 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:19,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-11 04:57:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:19,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 04:57:19,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:19,672 INFO L378 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-11-11 04:57:19,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2024-11-11 04:57:19,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:57:19,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2024-11-11 04:57:19,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:57:19,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50 [2024-11-11 04:57:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:19,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:19,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021326886] [2024-11-11 04:57:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021326886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:19,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 04:57:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084229865] [2024-11-11 04:57:19,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:19,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 04:57:19,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:19,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 04:57:19,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-11 04:57:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:19,834 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:19,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:19,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:19,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:19,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:19,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:20,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:20,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:20,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-11 04:57:20,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:20,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:20,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:20,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1204061749, now seen corresponding path program 1 times [2024-11-11 04:57:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:20,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380568804] [2024-11-11 04:57:20,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:20,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:20,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:20,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:20,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-11 04:57:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:20,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 04:57:20,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:20,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:57:20,765 INFO L378 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 38 treesize of output 16 [2024-11-11 04:57:20,768 INFO L378 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-11-11 04:57:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:20,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:20,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:20,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380568804] [2024-11-11 04:57:20,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380568804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:20,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 04:57:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301218905] [2024-11-11 04:57:20,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:20,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 04:57:20,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:20,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 04:57:20,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 04:57:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:20,813 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:20,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:20,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:20,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:20,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:20,888 INFO L378 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-11-11 04:57:20,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:21,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:21,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:21,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-11 04:57:21,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:21,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:21,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:21,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1420935436, now seen corresponding path program 1 times [2024-11-11 04:57:21,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:21,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163157964] [2024-11-11 04:57:21,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:21,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:21,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:21,596 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:21,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-11 04:57:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:21,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 04:57:21,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:21,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-11 04:57:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:21,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:21,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:21,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163157964] [2024-11-11 04:57:21,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163157964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:21,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:21,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:57:21,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034984532] [2024-11-11 04:57:21,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:21,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:57:21,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:21,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:57:21,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:57:21,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:21,773 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:21,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 58.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:21,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:21,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:21,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:21,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:21,824 INFO L378 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-11-11 04:57:21,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:22,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-11 04:57:22,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:22,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:22,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash -660560771, now seen corresponding path program 1 times [2024-11-11 04:57:22,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:22,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435465985] [2024-11-11 04:57:22,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:22,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:22,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:22,495 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:22,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-11 04:57:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:22,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 04:57:22,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:22,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:22,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:22,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435465985] [2024-11-11 04:57:22,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435465985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:22,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:22,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:57:22,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122309947] [2024-11-11 04:57:22,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:22,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:57:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:22,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:57:22,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:57:22,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:22,677 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:22,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 61.0) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:22,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:22,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:22,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:22,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:22,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:22,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-11 04:57:23,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:23,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:23,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:23,042 INFO L85 PathProgramCache]: Analyzing trace with hash -173472004, now seen corresponding path program 1 times [2024-11-11 04:57:23,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:23,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866778775] [2024-11-11 04:57:23,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:23,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:23,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:23,044 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:23,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-11 04:57:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:23,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 04:57:23,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:23,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 9 [2024-11-11 04:57:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:23,223 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:23,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:23,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866778775] [2024-11-11 04:57:23,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866778775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:23,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:23,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:57:23,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447466234] [2024-11-11 04:57:23,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:23,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:57:23,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:23,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:57:23,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:57:23,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:23,227 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:23,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 66.5) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:23,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:23,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:23,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:23,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:23,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:23,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:23,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:23,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:23,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-11 04:57:24,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:24,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:24,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:24,061 INFO L85 PathProgramCache]: Analyzing trace with hash -97775612, now seen corresponding path program 1 times [2024-11-11 04:57:24,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:24,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029159673] [2024-11-11 04:57:24,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:24,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:24,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:24,065 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:24,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-11 04:57:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:24,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 04:57:24,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:24,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:24,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029159673] [2024-11-11 04:57:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029159673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:24,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:24,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:57:24,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728610125] [2024-11-11 04:57:24,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:24,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:57:24,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:24,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:57:24,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:57:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:24,264 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:24,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 72.5) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:24,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:24,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:24,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:24,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:24,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:24,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:24,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:24,295 INFO L378 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-11-11 04:57:24,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:25,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:25,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:25,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:25,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:25,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:25,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-11-11 04:57:25,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-11-11 04:57:25,475 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-11-11 04:57:25,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-11-11 04:57:25,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-11-11 04:57:25,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-11-11 04:57:25,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err6ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-11-11 04:57:25,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-11-11 04:57:25,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err8ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-11-11 04:57:25,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err14ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-11-11 04:57:25,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err9ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-11-11 04:57:25,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err10ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-11-11 04:57:25,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err11ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-11-11 04:57:25,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err12ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-11-11 04:57:25,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err13ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-11-11 04:57:25,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-11 04:57:25,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:25,689 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-11 04:57:25,691 INFO L317 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2024-11-11 04:57:25,696 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:57:25,697 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 04:57:25,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-11 04:57:25,698 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5b443387, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:57:25,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 04:57:25,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-11 04:57:25,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:25,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1400770932, now seen corresponding path program 1 times [2024-11-11 04:57:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:25,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731678829] [2024-11-11 04:57:25,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:25,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:25,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:25,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:25,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-11 04:57:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 04:57:25,873 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 04:57:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 04:57:25,932 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-11 04:57:25,933 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 04:57:25,933 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-11-11 04:57:25,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-11 04:57:26,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:26,135 INFO L421 BasicCegarLoop]: Path program histogram: [1] [2024-11-11 04:57:26,135 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-11-11 04:57:26,136 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-11 04:57:26,136 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-11 04:57:26,209 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-11 04:57:26,213 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:57:26,214 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 04:57:26,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-11 04:57:26,215 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5b443387, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:57:26,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 04:57:26,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-11 04:57:26,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:26,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1767637611, now seen corresponding path program 1 times [2024-11-11 04:57:26,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:26,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683451241] [2024-11-11 04:57:26,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:26,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:26,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:26,358 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:26,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-11 04:57:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 04:57:26,508 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 04:57:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 04:57:26,592 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-11 04:57:26,592 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 04:57:26,593 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-11-11 04:57:26,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-11 04:57:26,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:26,795 INFO L421 BasicCegarLoop]: Path program histogram: [1] [2024-11-11 04:57:26,795 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-11-11 04:57:26,796 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-11 04:57:26,796 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-11 04:57:26,888 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-11 04:57:26,894 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:57:26,895 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 04:57:26,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-11-11 04:57:26,896 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5b443387, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 04:57:26,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-11 04:57:27,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:27,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash 688643053, now seen corresponding path program 1 times [2024-11-11 04:57:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:27,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858767462] [2024-11-11 04:57:27,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:27,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:27,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:27,301 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:27,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-11 04:57:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:27,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 04:57:27,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:27,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:27,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:27,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858767462] [2024-11-11 04:57:27,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858767462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:27,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:27,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-11 04:57:27,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909536155] [2024-11-11 04:57:27,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:27,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 04:57:27,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:27,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 04:57:27,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 04:57:27,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:27,466 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:27,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 102.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:27,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:27,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-11 04:57:28,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:28,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:28,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:28,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1898196330, now seen corresponding path program 1 times [2024-11-11 04:57:28,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:28,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955682938] [2024-11-11 04:57:28,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:28,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:28,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:28,021 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:28,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-11 04:57:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:28,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 04:57:28,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:28,235 INFO L378 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-11-11 04:57:28,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2024-11-11 04:57:28,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:57:28,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2024-11-11 04:57:28,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:57:28,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50 [2024-11-11 04:57:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:28,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:28,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:28,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955682938] [2024-11-11 04:57:28,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955682938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:28,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:28,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 04:57:28,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048607779] [2024-11-11 04:57:28,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:28,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 04:57:28,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:28,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 04:57:28,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-11 04:57:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:28,318 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:28,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:28,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:28,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:28,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:28,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:28,437 INFO L378 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-11-11 04:57:28,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:30,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:30,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-11 04:57:31,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:31,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err14ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:31,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1978453914, now seen corresponding path program 1 times [2024-11-11 04:57:31,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:31,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184652667] [2024-11-11 04:57:31,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:31,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:31,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:31,012 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:31,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-11 04:57:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:31,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 04:57:31,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:31,241 INFO L378 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-11-11 04:57:31,250 INFO L378 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 38 treesize of output 16 [2024-11-11 04:57:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:31,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:31,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184652667] [2024-11-11 04:57:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184652667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:31,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:31,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 04:57:31,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106865849] [2024-11-11 04:57:31,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:31,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 04:57:31,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:31,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 04:57:31,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 04:57:31,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:31,273 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:31,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:31,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:31,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:31,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:31,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:31,397 INFO L378 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-11-11 04:57:31,425 INFO L378 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-11-11 04:57:31,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:38,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:38,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:38,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-11 04:57:38,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:38,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err8ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:38,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash 837202853, now seen corresponding path program 1 times [2024-11-11 04:57:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:38,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408571626] [2024-11-11 04:57:38,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:38,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:38,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:38,513 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:38,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-11 04:57:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:38,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 04:57:38,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:38,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-11 04:57:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:38,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:38,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:38,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408571626] [2024-11-11 04:57:38,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408571626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:38,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:38,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:57:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546436803] [2024-11-11 04:57:38,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:38,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:57:38,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:38,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:57:38,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:57:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:38,696 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:38,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 60.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:38,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:38,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:38,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:38,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:38,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:38,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:38,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:38,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:39,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-11 04:57:39,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:39,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err9ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:39,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1534223954, now seen corresponding path program 1 times [2024-11-11 04:57:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:39,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640344263] [2024-11-11 04:57:39,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:39,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:39,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:39,685 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:39,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-11 04:57:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:39,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 04:57:39,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:39,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:39,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:39,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:39,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640344263] [2024-11-11 04:57:39,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640344263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:39,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:39,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:57:39,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157813435] [2024-11-11 04:57:39,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:39,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:57:39,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:39,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:57:39,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:57:39,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:39,883 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:39,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 63.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:39,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:39,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:39,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:39,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:39,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:42,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-11 04:57:42,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:42,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err11ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:42,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:42,783 INFO L85 PathProgramCache]: Analyzing trace with hash -173964967, now seen corresponding path program 1 times [2024-11-11 04:57:42,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:42,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230773183] [2024-11-11 04:57:42,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:42,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:42,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:42,784 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:42,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-11 04:57:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:42,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 04:57:42,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:42,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 9 [2024-11-11 04:57:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:42,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:42,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:42,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230773183] [2024-11-11 04:57:42,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230773183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:42,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:42,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:57:42,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944431555] [2024-11-11 04:57:42,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:42,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:57:42,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:42,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:57:42,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:57:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:42,995 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:42,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 68.5) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:42,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:42,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:42,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:42,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:42,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:42,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:43,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:43,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:43,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:43,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:46,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:46,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-11 04:57:46,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:46,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:46,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:46,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2051798687, now seen corresponding path program 1 times [2024-11-11 04:57:46,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:46,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922491809] [2024-11-11 04:57:46,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:46,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:46,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:46,493 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:46,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-11 04:57:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:46,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 04:57:46,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:57:46,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:46,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:46,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922491809] [2024-11-11 04:57:46,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922491809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:46,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:46,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 04:57:46,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936083715] [2024-11-11 04:57:46,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:46,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 04:57:46,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:46,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 04:57:46,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 04:57:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:46,699 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:46,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 74.5) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:46,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:46,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:46,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:46,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:46,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:46,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:46,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:46,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:46,741 INFO L378 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-11-11 04:57:46,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:46,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:56,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-11 04:57:56,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:56,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:56,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1033183224, now seen corresponding path program 1 times [2024-11-11 04:57:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775002689] [2024-11-11 04:57:56,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:57:56,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:56,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:56,325 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:56,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-11 04:57:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:57:56,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 04:57:56,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:56,726 INFO L378 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 8 treesize of output 1 [2024-11-11 04:57:56,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:57:56,811 INFO L378 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 38 treesize of output 16 [2024-11-11 04:57:56,813 INFO L378 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-11-11 04:57:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 04:57:56,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 04:57:56,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:57:56,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 193 [2024-11-11 04:57:57,015 INFO L378 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 6 treesize of output 4 [2024-11-11 04:57:57,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:57:57,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 188 [2024-11-11 04:57:57,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:57:57,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 182 [2024-11-11 04:57:57,338 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:57:57,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 19 [2024-11-11 04:57:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 04:57:57,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:57,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775002689] [2024-11-11 04:57:57,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775002689] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 04:57:57,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 04:57:57,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-11 04:57:57,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130262839] [2024-11-11 04:57:57,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 04:57:57,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 04:57:57,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:57,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 04:57:57,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-11 04:57:57,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:57,565 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:57,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 43.5) internal successors, (435), 10 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:57,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:57,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:57,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:57,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:57,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:57,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:57,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:57,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 04:57:58,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-11-11 04:57:58,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:58,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:57:58,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:57:58,565 INFO L85 PathProgramCache]: Analyzing trace with hash 144417271, now seen corresponding path program 2 times [2024-11-11 04:57:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:57:58,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562755265] [2024-11-11 04:57:58,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 04:57:58,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:57:58,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:57:58,567 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:57:58,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-11 04:57:58,927 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 04:57:58,928 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 04:57:58,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 04:57:58,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:57:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2024-11-11 04:57:58,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 04:57:58,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:57:58,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562755265] [2024-11-11 04:57:58,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562755265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 04:57:58,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 04:57:58,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 04:57:58,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360681379] [2024-11-11 04:57:58,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 04:57:58,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 04:57:58,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:57:58,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 04:57:58,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 04:57:58,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:58,999 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:57:58,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:57:58,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:58,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:57:58,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:57:58,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:58,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:58,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:58,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:57:58,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-11 04:57:59,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:57:59,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:59,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:57:59,060 INFO L378 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-11-11 04:57:59,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:58:06,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2024-11-11 04:58:06,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2024-11-11 04:58:06,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2024-11-11 04:58:06,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2024-11-11 04:58:35,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2024-11-11 04:58:35,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2024-11-11 04:58:35,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2024-11-11 04:58:35,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 50 [2024-11-11 04:59:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:59:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:59:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:59:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:59:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:59:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:59:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:59:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 04:59:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:59:46,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-11 04:59:46,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:59:46,225 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-11 04:59:46,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 04:59:46,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1695542229, now seen corresponding path program 1 times [2024-11-11 04:59:46,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 04:59:46,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19803713] [2024-11-11 04:59:46,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 04:59:46,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 04:59:46,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-11-11 04:59:46,228 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 04:59:46,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-11 04:59:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 04:59:46,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 04:59:46,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 04:59:46,890 INFO L378 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 8 treesize of output 1 [2024-11-11 04:59:46,962 INFO L378 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 8 treesize of output 1 [2024-11-11 04:59:47,038 INFO L378 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 8 treesize of output 1 [2024-11-11 04:59:47,112 INFO L378 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 8 treesize of output 1 [2024-11-11 04:59:47,184 INFO L378 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 8 treesize of output 1 [2024-11-11 04:59:47,257 INFO L378 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 8 treesize of output 1 [2024-11-11 04:59:47,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:59:47,286 INFO L378 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 38 treesize of output 16 [2024-11-11 04:59:47,287 INFO L378 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-11-11 04:59:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:59:47,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 04:59:47,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:59:47,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 193 [2024-11-11 04:59:47,420 INFO L378 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 6 treesize of output 4 [2024-11-11 04:59:47,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:59:47,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 188 [2024-11-11 04:59:48,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:59:48,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 188 [2024-11-11 04:59:48,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:59:48,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 188 [2024-11-11 04:59:48,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:59:48,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 188 [2024-11-11 04:59:49,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:59:49,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 188 [2024-11-11 04:59:49,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:59:49,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 188 [2024-11-11 04:59:49,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:59:49,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 182 [2024-11-11 04:59:49,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:59:49,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 19 [2024-11-11 04:59:49,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 04:59:49,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 19 [2024-11-11 04:59:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 04:59:50,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 04:59:50,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19803713] [2024-11-11 04:59:50,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19803713] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 04:59:50,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 04:59:50,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-11 04:59:50,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672886047] [2024-11-11 04:59:50,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 04:59:50,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 04:59:50,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 04:59:50,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 04:59:50,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-11-11 04:59:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:59:50,210 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 04:59:50,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 42.05) internal successors, (841), 20 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 04:59:50,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:59:50,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 04:59:50,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-11 04:59:50,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:59:50,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:59:50,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:59:50,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 04:59:50,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-11 04:59:50,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 04:59:50,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 04:59:50,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 04:59:50,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 Killed by 15