/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 2 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 10:14:34,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 10:14:34,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 10:14:34,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 10:14:34,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 10:14:34,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 10:14:34,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 10:14:34,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 10:14:34,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 10:14:34,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 10:14:34,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 10:14:34,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 10:14:34,503 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 10:14:34,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 10:14:34,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 10:14:34,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 10:14:34,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 10:14:34,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 10:14:34,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 10:14:34,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 10:14:34,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 10:14:34,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 10:14:34,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 10:14:34,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 10:14:34,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 10:14:34,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 10:14:34,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 10:14:34,512 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 10:14:34,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 10:14:34,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 10:14:34,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 10:14:34,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 10:14:34,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 10:14:34,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 10:14:34,514 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 10:14:34,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 10:14:34,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 10:14:34,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 10:14:34,514 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 10:14:34,514 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.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 2 [2024-04-05 10:14:34,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 10:14:34,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 10:14:34,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 10:14:34,708 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 10:14:34,709 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 10:14:34,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-04-05 10:14:35,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 10:14:35,855 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 10:14:35,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-04-05 10:14:35,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c0f004792/8634e0674bdd4b0d8c9c19faf3cc4ab0/FLAG2ee3fc8f5 [2024-04-05 10:14:35,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c0f004792/8634e0674bdd4b0d8c9c19faf3cc4ab0 [2024-04-05 10:14:35,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 10:14:35,879 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 10:14:35,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 10:14:35,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 10:14:35,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 10:14:35,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 10:14:35" (1/1) ... [2024-04-05 10:14:35,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba4bed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:35, skipping insertion in model container [2024-04-05 10:14:35,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 10:14:35" (1/1) ... [2024-04-05 10:14:35,924 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 10:14:36,208 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-04-05 10:14:36,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 10:14:36,223 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 10:14:36,293 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-04-05 10:14:36,295 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 10:14:36,322 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 10:14:36,322 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 10:14:36,328 INFO L206 MainTranslator]: Completed translation [2024-04-05 10:14:36,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36 WrapperNode [2024-04-05 10:14:36,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 10:14:36,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 10:14:36,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 10:14:36,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 10:14:36,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (1/1) ... [2024-04-05 10:14:36,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (1/1) ... [2024-04-05 10:14:36,394 INFO L138 Inliner]: procedures = 170, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-04-05 10:14:36,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 10:14:36,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 10:14:36,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 10:14:36,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 10:14:36,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (1/1) ... [2024-04-05 10:14:36,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (1/1) ... [2024-04-05 10:14:36,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (1/1) ... [2024-04-05 10:14:36,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (1/1) ... [2024-04-05 10:14:36,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (1/1) ... [2024-04-05 10:14:36,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (1/1) ... [2024-04-05 10:14:36,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (1/1) ... [2024-04-05 10:14:36,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (1/1) ... [2024-04-05 10:14:36,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 10:14:36,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 10:14:36,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 10:14:36,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 10:14:36,438 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (1/1) ... [2024-04-05 10:14:36,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 10:14:36,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:14:36,501 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-04-05 10:14:36,503 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-04-05 10:14:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 10:14:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-04-05 10:14:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-04-05 10:14:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 10:14:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-05 10:14:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 10:14:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 10:14:36,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 10:14:36,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 10:14:36,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-05 10:14:36,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 10:14:36,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 10:14:36,607 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 10:14:36,736 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 10:14:36,737 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 10:14:36,889 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 10:14:36,941 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 10:14:36,941 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-05 10:14:36,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 10:14:36 BoogieIcfgContainer [2024-04-05 10:14:36,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 10:14:36,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 10:14:36,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 10:14:36,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 10:14:36,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 10:14:35" (1/3) ... [2024-04-05 10:14:36,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7813efe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 10:14:36, skipping insertion in model container [2024-04-05 10:14:36,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 10:14:36" (2/3) ... [2024-04-05 10:14:36,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7813efe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 10:14:36, skipping insertion in model container [2024-04-05 10:14:36,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 10:14:36" (3/3) ... [2024-04-05 10:14:36,952 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-04-05 10:14:36,958 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 10:14:36,964 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 10:14:36,965 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 10:14:36,965 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 10:14:37,024 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 10:14:37,070 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 10:14:37,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 10:14:37,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:14:37,073 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-04-05 10:14:37,074 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-04-05 10:14:37,128 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 10:14:37,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:37,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 10:14:37,149 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@b87b5ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=2, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 10:14:37,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-05 10:14:37,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 10:14:37,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash 790974196, now seen corresponding path program 1 times [2024-04-05 10:14:37,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:37,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087474880] [2024-04-05 10:14:37,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:37,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:37,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:37,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087474880] [2024-04-05 10:14:37,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087474880] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:14:37,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:14:37,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 10:14:37,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406015755] [2024-04-05 10:14:37,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:14:37,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 10:14:37,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:37,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 10:14:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 10:14:37,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:37,479 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:37,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:14:37,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:37,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:37,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 10:14:37,532 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 10:14:37,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:37,532 INFO L85 PathProgramCache]: Analyzing trace with hash 623441482, now seen corresponding path program 1 times [2024-04-05 10:14:37,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:37,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565392774] [2024-04-05 10:14:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:37,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:37,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:37,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565392774] [2024-04-05 10:14:37,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565392774] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:14:37,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:14:37,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-04-05 10:14:37,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511858346] [2024-04-05 10:14:37,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:14:37,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-05 10:14:37,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:37,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-05 10:14:37,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-04-05 10:14:37,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:37,833 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:37,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:14:37,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:37,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 10:14:37,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 10:14:37,959 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 10:14:37,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:37,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1929615467, now seen corresponding path program 1 times [2024-04-05 10:14:37,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:37,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918936014] [2024-04-05 10:14:37,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:37,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:38,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:38,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918936014] [2024-04-05 10:14:38,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918936014] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:14:38,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:14:38,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 10:14:38,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060702741] [2024-04-05 10:14:38,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:14:38,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 10:14:38,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:38,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 10:14:38,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 10:14:38,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:38,641 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:38,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:14:38,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:38,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 10:14:38,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:14:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-04-05 10:14:38,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 10:14:38,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-04-05 10:14:38,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:38,894 INFO L85 PathProgramCache]: Analyzing trace with hash 540436402, now seen corresponding path program 1 times [2024-04-05 10:14:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:38,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725565684] [2024-04-05 10:14:38,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:38,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 10:14:38,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 10:14:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 10:14:38,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 10:14:38,937 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 10:14:38,938 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-04-05 10:14:38,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-04-05 10:14:38,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-04-05 10:14:38,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-04-05 10:14:38,943 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-04-05 10:14:38,945 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 10:14:38,945 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-04-05 10:14:38,963 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 10:14:38,965 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 10:14:38,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 10:14:38,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:14:38,998 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 10:14:39,001 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 10:14:39,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:39,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 10:14:39,002 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@b87b5ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=2, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 10:14:39,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-04-05 10:14:39,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-04-05 10:14:39,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 10:14:39,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1856933464, now seen corresponding path program 1 times [2024-04-05 10:14:39,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:39,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16742741] [2024-04-05 10:14:39,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:39,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:39,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:39,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16742741] [2024-04-05 10:14:39,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16742741] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:14:39,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:14:39,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 10:14:39,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098249915] [2024-04-05 10:14:39,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:14:39,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 10:14:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:39,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 10:14:39,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 10:14:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:39,030 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:39,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:14:39,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:39,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-04-05 10:14:39,044 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 10:14:39,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:39,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1237442431, now seen corresponding path program 1 times [2024-04-05 10:14:39,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:39,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833956842] [2024-04-05 10:14:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:39,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 10:14:39,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833956842] [2024-04-05 10:14:39,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833956842] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:14:39,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:14:39,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 10:14:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038660833] [2024-04-05 10:14:39,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:14:39,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 10:14:39,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:39,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 10:14:39,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 10:14:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:39,150 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:39,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:14:39,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:39,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:39,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 10:14:39,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-04-05 10:14:39,210 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 10:14:39,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:39,210 INFO L85 PathProgramCache]: Analyzing trace with hash 715489871, now seen corresponding path program 1 times [2024-04-05 10:14:39,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:39,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898880193] [2024-04-05 10:14:39,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:39,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:39,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:39,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898880193] [2024-04-05 10:14:39,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898880193] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:14:39,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:14:39,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 10:14:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236275187] [2024-04-05 10:14:39,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:14:39,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 10:14:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:39,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 10:14:39,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-04-05 10:14:39,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:39,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:39,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:14:39,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:39,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 10:14:39,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:39,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:14:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:14:39,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-04-05 10:14:39,681 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 10:14:39,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash -232196713, now seen corresponding path program 1 times [2024-04-05 10:14:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:39,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529928565] [2024-04-05 10:14:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:39,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:40,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529928565] [2024-04-05 10:14:40,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529928565] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:14:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565324619] [2024-04-05 10:14:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:40,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:14:40,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:14:40,164 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-04-05 10:14:40,172 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-04-05 10:14:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:40,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2024-04-05 10:14:40,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:14:40,345 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:14:40,346 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-04-05 10:14:40,401 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 16 treesize of output 11 [2024-04-05 10:14:40,453 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 10:14:40,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 10:14:40,596 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-04-05 10:14:40,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-04-05 10:14:40,665 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 16 treesize of output 11 [2024-04-05 10:14:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:40,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:14:40,767 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_120 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_120) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 10:14:41,286 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 180 treesize of output 168 [2024-04-05 10:14:41,294 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 17 treesize of output 15 [2024-04-05 10:14:41,298 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 28 treesize of output 24 [2024-04-05 10:14:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-04-05 10:14:41,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565324619] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:14:41,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:14:41,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 33 [2024-04-05 10:14:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757589560] [2024-04-05 10:14:41,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:14:41,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-04-05 10:14:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:41,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-04-05 10:14:41,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=848, Unknown=8, NotChecked=60, Total=1056 [2024-04-05 10:14:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:41,421 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:41,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 33 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-04-05 10:14:41,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:41,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:14:41,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:14:41,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:14:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:14:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 10:14:41,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-05 10:14:42,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:14:42,075 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 10:14:42,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1951612766, now seen corresponding path program 1 times [2024-04-05 10:14:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:42,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921333763] [2024-04-05 10:14:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:42,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:42,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:42,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921333763] [2024-04-05 10:14:42,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921333763] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:14:42,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610276556] [2024-04-05 10:14:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:42,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:14:42,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:14:42,719 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-04-05 10:14:42,745 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-04-05 10:14:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:42,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2024-04-05 10:14:42,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:14:42,831 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 10:14:42,831 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 19 treesize of output 16 [2024-04-05 10:14:42,870 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 10:14:42,870 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 19 treesize of output 16 [2024-04-05 10:14:42,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-04-05 10:14:42,965 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 10:14:42,966 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-04-05 10:14:43,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 10:14:43,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2024-04-05 10:14:43,147 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-04-05 10:14:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 10:14:43,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:14:43,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:14:43,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 10:14:43,495 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 53 treesize of output 37 [2024-04-05 10:14:43,518 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 17 treesize of output 15 [2024-04-05 10:14:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 10:14:43,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610276556] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:14:43,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:14:43,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2024-04-05 10:14:43,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557969631] [2024-04-05 10:14:43,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:14:43,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-05 10:14:43,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:43,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-05 10:14:43,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=738, Unknown=4, NotChecked=0, Total=870 [2024-04-05 10:14:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:43,710 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:43,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.655172413793103) internal successors, (135), 30 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:14:43,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:43,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:14:43,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:14:43,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 10:14:43,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:48,200 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-04-05 10:14:48,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:48,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:14:48,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:14:48,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:14:48,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:14:48,256 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-04-05 10:14:48,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:14:48,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-04-05 10:14:48,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1062705217, now seen corresponding path program 1 times [2024-04-05 10:14:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:48,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597547231] [2024-04-05 10:14:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 10:14:48,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 10:14:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 10:14:48,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 10:14:48,505 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 10:14:48,505 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-04-05 10:14:48,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-04-05 10:14:48,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-04-05 10:14:48,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-04-05 10:14:48,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-04-05 10:14:48,508 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-04-05 10:14:48,508 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 10:14:48,508 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-04-05 10:14:48,538 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 10:14:48,541 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 10:14:48,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 10:14:48,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:14:48,557 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 10:14:48,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-04-05 10:14:48,594 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 10:14:48,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:48,595 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 10:14:48,595 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@b87b5ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=2, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 10:14:48,595 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-05 10:14:48,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 10:14:48,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:48,603 INFO L85 PathProgramCache]: Analyzing trace with hash -42688683, now seen corresponding path program 1 times [2024-04-05 10:14:48,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:48,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797973067] [2024-04-05 10:14:48,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:48,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:48,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:48,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797973067] [2024-04-05 10:14:48,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797973067] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:14:48,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:14:48,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 10:14:48,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417440] [2024-04-05 10:14:48,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:14:48,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 10:14:48,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:48,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 10:14:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 10:14:48,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:48,613 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:48,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:14:48,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:48,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-04-05 10:14:48,626 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 10:14:48,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash 417728457, now seen corresponding path program 1 times [2024-04-05 10:14:48,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:48,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602279111] [2024-04-05 10:14:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:48,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 10:14:48,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:48,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602279111] [2024-04-05 10:14:48,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602279111] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:14:48,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:14:48,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 10:14:48,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116446523] [2024-04-05 10:14:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:14:48,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 10:14:48,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:48,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 10:14:48,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 10:14:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:48,727 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:48,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:14:48,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:48,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 10:14:48,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-04-05 10:14:48,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 10:14:48,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:48,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1782599532, now seen corresponding path program 1 times [2024-04-05 10:14:48,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:48,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366676085] [2024-04-05 10:14:48,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:48,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:49,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:49,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366676085] [2024-04-05 10:14:49,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366676085] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:14:49,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:14:49,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 10:14:49,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484785382] [2024-04-05 10:14:49,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:14:49,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 10:14:49,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:49,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 10:14:49,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 10:14:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:49,049 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:49,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:14:49,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:49,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 10:14:49,049 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:14:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:14:49,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-04-05 10:14:49,270 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 10:14:49,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:49,270 INFO L85 PathProgramCache]: Analyzing trace with hash -267004783, now seen corresponding path program 1 times [2024-04-05 10:14:49,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:49,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588183909] [2024-04-05 10:14:49,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:49,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 10:14:49,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:49,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588183909] [2024-04-05 10:14:49,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588183909] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:14:49,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797313260] [2024-04-05 10:14:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:49,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:14:49,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:14:49,778 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:14:49,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-04-05 10:14:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:49,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-05 10:14:49,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:14:49,943 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:14:49,944 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-04-05 10:14:49,992 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 16 treesize of output 11 [2024-04-05 10:14:50,032 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 10:14:50,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 10:14:50,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 10:14:50,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 10:14:50,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 10:14:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 10:14:50,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:14:51,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 10:14:51,236 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-04-05 10:14:51,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 162 [2024-04-05 10:14:51,241 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 27 treesize of output 25 [2024-04-05 10:14:51,244 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 34 treesize of output 30 [2024-04-05 10:14:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 6 refuted. 11 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 10:14:51,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797313260] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:14:51,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:14:51,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 34 [2024-04-05 10:14:51,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258285012] [2024-04-05 10:14:51,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:14:51,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-04-05 10:14:51,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:14:51,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-04-05 10:14:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=924, Unknown=19, NotChecked=0, Total=1122 [2024-04-05 10:14:51,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:51,325 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:14:51,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.205882352941177) internal successors, (177), 34 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:14:51,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:51,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:14:51,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:14:51,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:51,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:14:51,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:14:51,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:14:51,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 10:14:51,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-04-05 10:14:52,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-04-05 10:14:52,075 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 10:14:52,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:14:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash -737606014, now seen corresponding path program 1 times [2024-04-05 10:14:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:14:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387836191] [2024-04-05 10:14:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:14:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:14:52,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387836191] [2024-04-05 10:14:52,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387836191] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:14:52,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207003394] [2024-04-05 10:14:52,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:14:52,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:14:52,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:14:52,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:14:52,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-04-05 10:14:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:14:52,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjunts are in the unsatisfiable core [2024-04-05 10:14:52,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:14:52,672 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:14:52,672 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-04-05 10:14:52,728 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 16 treesize of output 11 [2024-04-05 10:14:52,783 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 10:14:52,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 10:14:52,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 10:14:53,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 10:14:53,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 10:14:53,414 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 10:14:53,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 10:14:53,557 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-04-05 10:14:53,567 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 10:14:53,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 10:14:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:14:53,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:15:21,109 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 10:15:21,110 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 69 [2024-04-05 10:15:21,125 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 10:15:21,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 88 [2024-04-05 10:15:21,130 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 58 treesize of output 52 [2024-04-05 10:15:21,133 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 32 treesize of output 28 [2024-04-05 10:15:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:15:26,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207003394] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:15:26,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:15:26,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 43 [2024-04-05 10:15:26,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185221412] [2024-04-05 10:15:26,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:15:26,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-04-05 10:15:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:15:26,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-04-05 10:15:26,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1572, Unknown=39, NotChecked=0, Total=1892 [2024-04-05 10:15:26,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:26,154 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:15:26,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.441860465116279) internal successors, (148), 44 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-04-05 10:15:26,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:26,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:15:26,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:15:26,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 10:15:26,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:15:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:15:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 10:15:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 10:15:27,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-04-05 10:15:27,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-04-05 10:15:27,451 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 10:15:27,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:15:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash -928964791, now seen corresponding path program 1 times [2024-04-05 10:15:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:15:27,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483624979] [2024-04-05 10:15:27,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:27,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:15:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:15:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:15:28,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:15:28,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483624979] [2024-04-05 10:15:28,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483624979] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:15:28,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134058033] [2024-04-05 10:15:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:28,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:15:28,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:15:28,294 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:15:28,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-04-05 10:15:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:15:28,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 40 conjunts are in the unsatisfiable core [2024-04-05 10:15:28,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:15:28,505 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 10:15:28,505 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 19 treesize of output 16 [2024-04-05 10:15:28,587 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 16 treesize of output 11 [2024-04-05 10:15:28,636 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 10:15:28,637 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-04-05 10:15:28,778 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 35 treesize of output 18 [2024-04-05 10:15:28,979 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 10:15:28,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 10:15:29,241 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 10:15:29,241 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 10:15:29,444 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 10:15:29,445 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 2 case distinctions, treesize of input 32 treesize of output 32 [2024-04-05 10:15:29,534 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 23 treesize of output 11 [2024-04-05 10:15:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:15:29,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:15:32,228 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_423 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ 1 (select .cse6 |c_~#value~0.offset|))))))) (let ((.cse4 (store (select .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store (store .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_419) |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse4)) (.cse1 (store .cse2 |c_~#value~0.offset| (+ .cse3 1)))) (store (store .cse0 |c_~#value~0.base| .cse1) |thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_419) |c_~#value~0.base| .cse1) |thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_423) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= (mod .cse3 4294967296) 4294967295))))))) is different from false [2024-04-05 10:15:33,957 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-04-05 10:15:33,958 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 31601 treesize of output 30190 [2024-04-05 10:15:34,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:15:34,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 592 treesize of output 608 [2024-04-05 10:15:34,052 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 28 treesize of output 24 [2024-04-05 10:15:34,070 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 62 treesize of output 54 [2024-04-05 10:15:34,258 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-04-05 10:15:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-04-05 10:15:34,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134058033] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:15:34,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:15:34,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 52 [2024-04-05 10:15:34,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632690417] [2024-04-05 10:15:34,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:15:34,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-04-05 10:15:34,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:15:34,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-04-05 10:15:34,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=2153, Unknown=72, NotChecked=98, Total=2652 [2024-04-05 10:15:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:34,380 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:15:34,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.019230769230769) internal successors, (209), 52 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:15:34,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:34,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:15:34,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:15:34,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-04-05 10:15:34,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 10:15:34,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:36,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:36,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:15:36,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:15:36,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:15:36,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 10:15:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 10:15:36,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-04-05 10:15:36,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:15:36,917 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 10:15:36,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:15:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1454667501, now seen corresponding path program 1 times [2024-04-05 10:15:36,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:15:36,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153605344] [2024-04-05 10:15:36,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:36,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:15:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:15:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 10:15:37,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:15:37,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153605344] [2024-04-05 10:15:37,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153605344] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:15:37,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669094507] [2024-04-05 10:15:37,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:37,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:15:37,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:15:37,486 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:15:37,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-04-05 10:15:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:15:37,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 10:15:37,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:15:37,630 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:15:37,630 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-04-05 10:15:37,766 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 10:15:37,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 10:15:37,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 10:15:38,017 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 10:15:38,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 10:15:38,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 10:15:38,230 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 10:15:38,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 10:15:38,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 10:15:38,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2024-04-05 10:15:38,362 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 33 treesize of output 16 [2024-04-05 10:15:38,365 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 16 treesize of output 13 [2024-04-05 10:15:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 10:15:38,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:15:38,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:15:38,660 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 10:15:38,662 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 53 treesize of output 37 [2024-04-05 10:15:38,669 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 17 treesize of output 15 [2024-04-05 10:15:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 10:15:38,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669094507] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:15:38,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:15:38,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 31 [2024-04-05 10:15:38,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074699228] [2024-04-05 10:15:38,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:15:38,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 10:15:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:15:38,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 10:15:38,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=836, Unknown=2, NotChecked=0, Total=992 [2024-04-05 10:15:38,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:38,940 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:15:38,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 6.225806451612903) internal successors, (193), 32 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:15:38,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:38,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:15:38,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:15:38,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:15:38,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 10:15:38,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 10:15:38,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:15:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:15:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:15:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 10:15:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-05 10:15:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 10:15:39,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-04-05 10:15:39,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-04-05 10:15:39,822 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-04-05 10:15:39,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:15:39,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1094034385, now seen corresponding path program 1 times [2024-04-05 10:15:39,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:15:39,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561998759] [2024-04-05 10:15:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:15:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 10:15:39,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 10:15:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 10:15:39,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 10:15:39,906 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 10:15:39,906 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-04-05 10:15:39,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-04-05 10:15:39,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-04-05 10:15:39,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-04-05 10:15:39,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-04-05 10:15:39,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-04-05 10:15:39,909 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-04-05 10:15:39,909 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 10:15:39,909 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-04-05 10:15:39,928 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 10:15:39,931 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 10:15:39,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 10:15:39,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:15:39,932 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 10:15:39,938 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 10:15:39,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:15:39,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 10:15:39,939 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@b87b5ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=2, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 10:15:39,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-05 10:15:39,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2024-04-05 10:15:39,945 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 10:15:39,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:15:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1788341269, now seen corresponding path program 1 times [2024-04-05 10:15:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:15:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638213593] [2024-04-05 10:15:39,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:39,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:15:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:15:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:15:39,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:15:39,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638213593] [2024-04-05 10:15:39,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638213593] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:15:39,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:15:39,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 10:15:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922602752] [2024-04-05 10:15:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:15:39,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 10:15:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:15:39,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 10:15:39,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 10:15:39,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:39,954 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:15:39,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:15:39,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:39,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-04-05 10:15:39,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 10:15:39,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:15:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash -423966927, now seen corresponding path program 1 times [2024-04-05 10:15:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:15:39,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129620732] [2024-04-05 10:15:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:39,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:15:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:15:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-05 10:15:40,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:15:40,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129620732] [2024-04-05 10:15:40,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129620732] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:15:40,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:15:40,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 10:15:40,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409114555] [2024-04-05 10:15:40,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:15:40,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 10:15:40,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:15:40,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 10:15:40,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 10:15:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:40,107 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:15:40,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:15:40,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:40,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:40,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:40,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 10:15:40,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-04-05 10:15:40,178 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 10:15:40,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:15:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1513268162, now seen corresponding path program 1 times [2024-04-05 10:15:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:15:40,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662789461] [2024-04-05 10:15:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:15:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:15:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:15:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:15:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662789461] [2024-04-05 10:15:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662789461] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:15:40,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:15:40,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 10:15:40,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473730414] [2024-04-05 10:15:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:15:40,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 10:15:40,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:15:40,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 10:15:40,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-04-05 10:15:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:40,447 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:15:40,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:15:40,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:40,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 10:15:40,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:15:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:15:40,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-04-05 10:15:40,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 10:15:40,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:15:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1415847127, now seen corresponding path program 1 times [2024-04-05 10:15:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:15:40,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597851529] [2024-04-05 10:15:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:40,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:15:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:15:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 10:15:41,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:15:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597851529] [2024-04-05 10:15:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597851529] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:15:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688795540] [2024-04-05 10:15:41,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:41,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:15:41,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:15:41,184 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:15:41,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-04-05 10:15:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:15:41,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-05 10:15:41,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:15:41,376 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 10:15:41,376 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-04-05 10:15:41,424 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 16 treesize of output 11 [2024-04-05 10:15:41,583 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 10:15:41,583 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 2 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 10:15:41,694 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 10:15:41,694 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 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 10:15:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 10:15:41,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:15:44,692 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 10:15:44,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 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 33 [2024-04-05 10:15:44,697 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 10:15:44,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 10:15:44,701 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 7 treesize of output 5 [2024-04-05 10:15:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 3 refuted. 4 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 10:15:44,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688795540] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:15:44,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:15:44,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2024-04-05 10:15:44,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936914965] [2024-04-05 10:15:44,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:15:44,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 10:15:44,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:15:44,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 10:15:44,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=828, Unknown=23, NotChecked=0, Total=992 [2024-04-05 10:15:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:44,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:15:44,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.125) internal successors, (164), 32 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:15:44,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:44,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:15:44,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:15:44,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:15:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:15:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:15:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 10:15:45,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-04-05 10:15:45,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:15:45,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 10:15:45,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:15:45,581 INFO L85 PathProgramCache]: Analyzing trace with hash -222757182, now seen corresponding path program 1 times [2024-04-05 10:15:45,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:15:45,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415935869] [2024-04-05 10:15:45,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:45,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:15:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:15:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:15:46,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:15:46,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415935869] [2024-04-05 10:15:46,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415935869] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:15:46,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458057655] [2024-04-05 10:15:46,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:15:46,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:15:46,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:15:46,029 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:15:46,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-04-05 10:15:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:15:46,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 39 conjunts are in the unsatisfiable core [2024-04-05 10:15:46,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:15:46,212 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:15:46,213 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-04-05 10:15:46,261 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 16 treesize of output 11 [2024-04-05 10:15:46,317 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 10:15:46,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 10:15:46,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 10:15:46,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 10:15:46,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 10:15:46,770 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 10:15:46,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 10:15:46,956 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-04-05 10:15:46,968 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 10:15:46,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 10:15:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:15:47,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:16:10,484 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 10:16:10,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:16:10,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 934 treesize of output 880 [2024-04-05 10:16:10,506 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 86 treesize of output 78 [2024-04-05 10:16:10,512 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 164 treesize of output 152 [2024-04-05 10:16:10,523 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 115 treesize of output 113 [2024-04-05 10:16:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:16:15,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458057655] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:16:15,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:16:15,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2024-04-05 10:16:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933846986] [2024-04-05 10:16:15,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:16:15,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-04-05 10:16:15,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:16:15,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-04-05 10:16:15,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1638, Unknown=46, NotChecked=0, Total=1980 [2024-04-05 10:16:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:15,084 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:16:15,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.3636363636363638) internal successors, (148), 45 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-04-05 10:16:15,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:15,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:16:15,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:16:15,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 10:16:15,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:16:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:16:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:16:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 10:16:16,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-04-05 10:16:16,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-04-05 10:16:16,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 10:16:16,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:16:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash -759787727, now seen corresponding path program 1 times [2024-04-05 10:16:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:16:16,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660047421] [2024-04-05 10:16:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:16:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:16:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:16:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 10:16:17,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:16:17,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660047421] [2024-04-05 10:16:17,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660047421] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:16:17,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122646819] [2024-04-05 10:16:17,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:16:17,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:16:17,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:16:17,306 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:16:17,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-04-05 10:16:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:16:17,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 52 conjunts are in the unsatisfiable core [2024-04-05 10:16:17,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:16:17,590 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:16:17,590 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-04-05 10:16:17,665 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 16 treesize of output 11 [2024-04-05 10:16:17,723 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 10:16:17,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 10:16:17,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 10:16:18,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 10:16:18,450 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 10:16:18,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 10:16:18,659 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 10:16:18,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 42 [2024-04-05 10:16:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 10:16:18,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:16:21,653 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_786 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (|thr1Thread2of4ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ 1 (select .cse6 |c_~#value~0.offset|))))))) (let ((.cse4 (store (select .cse5 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (select (store (store .cse5 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (or (= 4294967295 (mod .cse0 4294967296)) (< (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse4)) (.cse2 (store .cse3 |c_~#value~0.offset| (+ .cse0 1)))) (store (store .cse1 |c_~#value~0.base| .cse2) |thr1Thread2of4ForFork0_~#casret~0#1.base| (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_786) |c_~#value~0.base| .cse2) |thr1Thread2of4ForFork0_~#casret~0#1.base|) |thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_793) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) is different from false [2024-04-05 10:16:22,388 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 10:16:22,594 INFO L349 Elim1Store]: treesize reduction 47, result has 42.7 percent of original size [2024-04-05 10:16:22,594 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 4807 treesize of output 4543 [2024-04-05 10:16:22,676 INFO L349 Elim1Store]: treesize reduction 47, result has 42.7 percent of original size [2024-04-05 10:16:22,677 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 465 treesize of output 435 [2024-04-05 10:16:22,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 10:16:22,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:16:22,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 582 treesize of output 578 [2024-04-05 10:16:22,783 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 283 treesize of output 275 [2024-04-05 10:16:22,793 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 50 treesize of output 46 [2024-04-05 10:16:22,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:16:22,815 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2024-04-05 10:16:22,845 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-04-05 10:16:22,916 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-04-05 10:16:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 9 refuted. 20 times theorem prover too weak. 7 trivial. 6 not checked. [2024-04-05 10:16:23,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122646819] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:16:23,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:16:23,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 19] total 52 [2024-04-05 10:16:23,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356671767] [2024-04-05 10:16:23,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:16:23,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-04-05 10:16:23,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:16:23,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-04-05 10:16:23,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2130, Unknown=81, NotChecked=98, Total=2652 [2024-04-05 10:16:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:23,100 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:16:23,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.480769230769231) internal successors, (233), 52 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:16:23,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:23,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:16:23,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:16:23,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:16:23,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 10:16:23,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:16:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:16:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:16:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 10:16:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 10:16:25,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-04-05 10:16:25,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-04-05 10:16:25,529 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 10:16:25,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:16:25,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1161605635, now seen corresponding path program 1 times [2024-04-05 10:16:25,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:16:25,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346081992] [2024-04-05 10:16:25,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:16:25,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:16:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:16:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 10:16:26,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:16:26,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346081992] [2024-04-05 10:16:26,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346081992] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:16:26,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811017074] [2024-04-05 10:16:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:16:26,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:16:26,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:16:26,206 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:16:26,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-04-05 10:16:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:16:26,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 10:16:26,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:16:26,378 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:16:26,378 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-04-05 10:16:26,509 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 10:16:26,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 10:16:26,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 10:16:26,722 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 10:16:26,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 10:16:26,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 10:16:26,926 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 10:16:26,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 10:16:27,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 10:16:27,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 10:16:27,069 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-04-05 10:16:27,072 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 18 treesize of output 13 [2024-04-05 10:16:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 10:16:27,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:16:27,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:16:27,446 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 10:16:27,448 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 53 treesize of output 37 [2024-04-05 10:16:27,454 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 14 treesize of output 12 [2024-04-05 10:16:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 10:16:27,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811017074] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:16:27,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:16:27,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 34 [2024-04-05 10:16:27,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164342639] [2024-04-05 10:16:27,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:16:27,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-04-05 10:16:27,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:16:27,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-04-05 10:16:27,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1017, Unknown=4, NotChecked=0, Total=1190 [2024-04-05 10:16:27,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:27,754 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:16:27,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 5.676470588235294) internal successors, (193), 35 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:16:27,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:27,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:16:27,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:16:27,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:16:27,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 10:16:27,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 10:16:27,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:16:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:16:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:16:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:16:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 10:16:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-04-05 10:16:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 10:16:28,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-04-05 10:16:28,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-04-05 10:16:28,976 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 10:16:28,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:16:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash -371588503, now seen corresponding path program 1 times [2024-04-05 10:16:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:16:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187048731] [2024-04-05 10:16:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:16:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:16:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:16:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:16:30,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:16:30,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187048731] [2024-04-05 10:16:30,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187048731] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:16:30,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345398190] [2024-04-05 10:16:30,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:16:30,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:16:30,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:16:30,206 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:16:30,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-04-05 10:16:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:16:30,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-05 10:16:30,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:16:30,461 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:16:30,461 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-04-05 10:16:30,539 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 16 treesize of output 11 [2024-04-05 10:16:30,593 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 10:16:30,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 10:16:30,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 10:16:30,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 10:16:31,289 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 10:16:31,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 10:16:31,536 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 10:16:31,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 35 [2024-04-05 10:16:31,851 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 10:16:31,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 10:16:32,047 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 10:16:32,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 42 [2024-04-05 10:16:32,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-04-05 10:16:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:16:32,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:16:40,178 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296))) (let ((.cse4 (+ .cse12 1)) (.cse5 (= (mod (select .cse11 |c_~#value~0.offset|) 4294967296) .cse12))) (and (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_28 (Array Int Int)) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_28))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse3 1))))) (store .cse0 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse0 |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse3 4294967296) .cse4)))))) .cse5) (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| |c_thr1Thread2of4ForFork0_~vn~0#1|)))) (let ((.cse7 (store (select .cse10 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store .cse10 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base|))) (let ((.cse9 (select .cse8 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse6 (store (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse9 1))))) (store .cse6 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse6 |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse9 4294967296) .cse4))))))) (not .cse5))))) is different from false [2024-04-05 10:16:40,208 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread2of4ForFork0_~v~0#1| 4294967296))) (let ((.cse5 (= (mod (select .cse11 |c_~#value~0.offset|) 4294967296) .cse12)) (.cse4 (+ .cse12 1))) (and (or (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_28 (Array Int Int)) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_28))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ .cse3 1))))) (store .cse0 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse0 |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse3 4294967296) .cse4)))))) .cse5) (or (not .cse5) (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ |c_thr1Thread2of4ForFork0_~v~0#1| 1))))) (let ((.cse8 (store (select .cse10 |thr1Thread2of4ForFork0_~#casret~0#1.base|) |c_thr1Thread2of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse10 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base|))) (let ((.cse6 (select .cse9 |c_~#value~0.offset|))) (or (< (mod .cse6 4294967296) .cse4) (< (mod (select (select (store (let ((.cse7 (store (store |c_#memory_int| |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse6 1))))) (store .cse7 |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select .cse7 |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))))) is different from false [2024-04-05 10:16:52,155 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread2of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.base| Int) (|thr1Thread3of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_973 (Array Int Int)) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse11 |c_~#value~0.offset| (+ 1 (select .cse11 |c_~#value~0.offset|))))))) (let ((.cse9 (store (select .cse10 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store (store .cse10 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse9) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_961) |c_~#value~0.base|)) (.cse0 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse9))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_961)) (.cse6 (select .cse8 |c_~#value~0.offset|))) (let ((.cse7 (store .cse3 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse6 1))))) (let ((.cse1 (store (select .cse7 |thr1Thread2of4ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse4 (select (store .cse7 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse5 1)))) (store (store (store .cse0 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread3of4ForFork0_~#casret~0#1.base| (store (select (store (store .cse3 |thr1Thread2of4ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread3of4ForFork0_~#casret~0#1.base|) |thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_973) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse5 4294967296) (+ (mod .cse6 4294967296) 1)))))))))))) is different from false [2024-04-05 10:16:56,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 10:17:36,980 WARN L293 SmtUtils]: Spent 40.35s on a formula simplification. DAG size of input: 64 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-05 10:17:36,981 INFO L349 Elim1Store]: treesize reduction 76, result has 41.5 percent of original size [2024-04-05 10:17:36,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 6576637 treesize of output 6046148 [2024-04-05 10:17:38,022 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-04-05 10:17:38,023 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 35941 treesize of output 34803 [2024-04-05 10:17:38,157 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 4134 treesize of output 4070 [2024-04-05 10:17:38,218 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 870 treesize of output 790 [2024-04-05 10:17:38,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:17:38,390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2024-04-05 10:17:38,434 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-04-05 10:17:39,286 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-04-05 10:17:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 28 refuted. 8 times theorem prover too weak. 0 trivial. 6 not checked. [2024-04-05 10:17:39,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345398190] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:17:39,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:17:39,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 23] total 70 [2024-04-05 10:17:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811380777] [2024-04-05 10:17:39,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:17:39,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-04-05 10:17:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:17:39,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-04-05 10:17:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=3800, Unknown=111, NotChecked=396, Total=4830 [2024-04-05 10:17:39,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:17:39,515 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:17:39,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 3.9714285714285715) internal successors, (278), 70 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:17:39,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:17:39,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:17:39,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:17:39,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:17:39,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 10:17:39,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-04-05 10:17:39,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 10:17:39,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:17:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:17:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:17:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:17:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:17:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 10:17:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 10:17:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 10:17:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-05 10:17:46,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-04-05 10:17:46,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:17:46,545 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 10:17:46,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:17:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash -325667869, now seen corresponding path program 1 times [2024-04-05 10:17:46,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:17:46,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499169873] [2024-04-05 10:17:46,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:17:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:17:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:17:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 10:17:47,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:17:47,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499169873] [2024-04-05 10:17:47,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499169873] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:17:47,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548756996] [2024-04-05 10:17:47,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:17:47,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:17:47,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:17:47,172 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:17:47,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-04-05 10:17:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:17:47,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 72 conjunts are in the unsatisfiable core [2024-04-05 10:17:47,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:17:47,447 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:17:47,448 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-04-05 10:17:47,507 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 16 treesize of output 11 [2024-04-05 10:17:47,586 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 10:17:47,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 10:17:47,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 10:17:47,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 10:17:48,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 10:17:48,160 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 10:17:48,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 10:17:48,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-04-05 10:17:48,455 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 10:17:48,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 10:17:48,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 10:17:48,687 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 16 treesize of output 11 [2024-04-05 10:17:48,754 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2024-04-05 10:17:48,755 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 2 case distinctions, treesize of input 19 treesize of output 25 [2024-04-05 10:17:48,937 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 10:17:48,938 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 10:17:49,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 10:17:49,130 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 10:17:49,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 10:17:49,270 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-04-05 10:17:49,270 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 37 treesize of output 45 [2024-04-05 10:17:49,352 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 10:17:49,352 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-04-05 10:17:49,538 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-04-05 10:17:49,541 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 16 treesize of output 11 [2024-04-05 10:17:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:17:49,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:17:50,534 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (mod |c_thr1Thread3of4ForFork0_~v~0#1| 4294967296)) (.cse11 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (= .cse12 (mod (select .cse11 |c_~#value~0.offset|) 4294967296))) (.cse1 (+ .cse12 1))) (and (or (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (or (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse2 (select .cse4 |c_~#value~0.offset|))) (< (mod .cse2 4294967296) (mod (select (select (store (store .cse3 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ .cse2 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) .cse5) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| |c_thr1Thread3of4ForFork0_~vn~0#1|)))) (let ((.cse7 (store (select .cse10 |c_thr1Thread3of4ForFork0_~#casret~0#1.base|) |c_thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (store .cse10 |c_thr1Thread3of4ForFork0_~#casret~0#1.base| .cse7))) (or (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse6 (select .cse8 |c_~#value~0.offset|))) (< (mod .cse6 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse6 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (not .cse5) (< (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1)))))))) is different from false [2024-04-05 10:17:50,584 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread3of4ForFork0_~v~0#1| 4294967296))) (let ((.cse2 (+ .cse12 1)) (.cse0 (= .cse12 (mod (select .cse7 |c_~#value~0.offset|) 4294967296)))) (and (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ |c_thr1Thread3of4ForFork0_~v~0#1| 1))))) (let ((.cse4 (store (select .cse6 |c_thr1Thread3of4ForFork0_~#casret~0#1.base|) |c_thr1Thread3of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse1 (store .cse6 |c_thr1Thread3of4ForFork0_~#casret~0#1.base| .cse4))) (or (not .cse0) (< (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (or (let ((.cse5 (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse3 (select .cse5 |c_~#value~0.offset|))) (< (mod .cse3 4294967296) (mod (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ .cse3 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)))))))) (or (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (v_DerPreprocessor_32 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse8 (store |c_#memory_int| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_32))) (or (not (= (select (store |c_#valid| |c_thr1Thread3of4ForFork0_~#casret~0#1.base| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087))) (let ((.cse11 (select .cse10 |c_~#value~0.base|))) (let ((.cse9 (select .cse11 |c_~#value~0.offset|))) (< (mod .cse9 4294967296) (mod (select (select (store (store .cse10 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse9 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) .cse0)))) is different from false [2024-04-05 10:17:58,338 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (v_ArrVal_1078 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| Int) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse8 (select .cse10 |c_~#value~0.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ 1 .cse8))) |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (let ((.cse9 (select (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse2 (select .cse9 |c_~#value~0.offset|))) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_33)) (.cse6 (store .cse9 |c_~#value~0.offset| (+ .cse2 1)))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse6))) (let ((.cse1 (store (select .cse0 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1))) (or (not (= (select (store (store |c_#valid| |c_thr1Thread2of4ForFork0_~#casret~0#1.base| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store .cse0 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse1) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse2 4294967296) 1)) (let ((.cse5 (select (store (store (store .cse4 |c_~#value~0.base| .cse6) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse3 (select .cse5 |c_~#value~0.offset|))) (< (mod .cse3 4294967296) (mod (select (select (store (store (store (store .cse4 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ .cse3 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse8 4294967296) 1)))))))))))) is different from false [2024-04-05 10:18:04,158 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| Int) (v_ArrVal_1078 Int) (v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| Int) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse12 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse12 |c_~#value~0.offset|))) (let ((.cse2 (store .cse12 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse10 (select .cse11 |c_~#value~0.offset|))) (let ((.cse5 (store |c_#memory_int| |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33)) (.cse8 (store .cse11 |c_~#value~0.offset| (+ .cse10 1)))) (let ((.cse9 (store (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse8))) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse6 (store (select .cse9 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1))) (or (not (= (select .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34|) 0)) (< (mod (select (select (store (store .cse1 |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)) (not (= (select (store (store .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse7 (select (store (store (store .cse5 |c_~#value~0.base| .cse8) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse4 (select .cse7 |c_~#value~0.offset|))) (< (mod .cse4 4294967296) (mod (select (select (store (store (store (store .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse4 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select (store .cse9 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse10 4294967296) 1))))))))))))) is different from false [2024-04-05 10:18:04,794 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse30 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select .cse30 |c_~#value~0.offset|) 4294967296)))) (and (or .cse0 (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| Int) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse13 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_35))) (let ((.cse9 (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse14 (select .cse9 |c_~#value~0.base|))) (let ((.cse11 (select .cse14 |c_~#value~0.offset|))) (let ((.cse10 (store .cse14 |c_~#value~0.offset| (+ .cse11 1)))) (let ((.cse12 (select (store (store (store .cse13 |c_~#value~0.base| .cse10) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse4 (select .cse12 |c_~#value~0.offset|))) (let ((.cse6 (store .cse13 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33)) (.cse8 (store .cse12 |c_~#value~0.offset| (+ .cse4 1)))) (let ((.cse2 (store (store .cse6 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse8))) (let ((.cse1 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse3 (store (select .cse2 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1))) (or (not (= (select .cse1 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34|) 0)) (not (= (select (store (store .cse1 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store .cse2 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse3) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse4 4294967296) 1)) (let ((.cse7 (select (store (store (store .cse6 |c_~#value~0.base| .cse8) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (< (mod .cse5 4294967296) (mod (select (select (store (store (store (store .cse6 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse5 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select (store (store .cse9 |c_~#value~0.base| .cse10) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse11 4294967296) 1))))))))))))))) (or (not .cse0) (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| Int) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse29 (store |c_#memory_int| |c_~#value~0.base| (store .cse30 |c_~#value~0.offset| |c_thr1Thread1of4ForFork0_~vn~0#1|)))) (let ((.cse28 (store (select .cse29 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse27 (select (store (store .cse29 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse28) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base|))) (let ((.cse23 (select .cse27 |c_~#value~0.offset|))) (let ((.cse21 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse28)) (.cse22 (store .cse27 |c_~#value~0.offset| (+ .cse23 1)))) (let ((.cse26 (select (store (store (store .cse21 |c_~#value~0.base| .cse22) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse25 (select .cse26 |c_~#value~0.offset|))) (let ((.cse17 (store .cse21 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33)) (.cse20 (store .cse26 |c_~#value~0.offset| (+ .cse25 1)))) (let ((.cse24 (store (store .cse17 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse20))) (let ((.cse15 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse18 (store (select .cse24 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1))) (or (not (= (select .cse15 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34|) 0)) (not (= (select (store (store .cse15 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse19 (select (store (store (store .cse17 |c_~#value~0.base| .cse20) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse18) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse16 (select .cse19 |c_~#value~0.offset|))) (< (mod .cse16 4294967296) (mod (select (select (store (store (store (store .cse17 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse18) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse19 |c_~#value~0.offset| (+ .cse16 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select (store (store (store .cse21 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse22) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse23 4294967296) 1)) (< (mod (select (select (store .cse24 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse18) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse25 4294967296) 1)))))))))))))))))) is different from false [2024-04-05 10:18:04,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse16 (= (mod |c_thr1Thread1of4ForFork0_~v~0#1| 4294967296) (mod (select .cse15 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| Int) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse14 (store |c_#memory_int| |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| (+ |c_thr1Thread1of4ForFork0_~v~0#1| 1))))) (let ((.cse13 (store (select .cse14 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse12 (select (store (store .cse14 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base|))) (let ((.cse3 (select .cse12 |c_~#value~0.offset|))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13)) (.cse2 (store .cse12 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse11 (select (store (store (store .cse1 |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse10 (select .cse11 |c_~#value~0.offset|))) (let ((.cse5 (store .cse1 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33)) (.cse8 (store .cse11 |c_~#value~0.offset| (+ .cse10 1)))) (let ((.cse9 (store (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse8))) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse6 (store (select .cse9 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1))) (or (not (= (select .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34|) 0)) (< (mod (select (select (store (store (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse2) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)) (not (= (select (store (store .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (let ((.cse7 (select (store (store (store .cse5 |c_~#value~0.base| .cse8) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse4 (select .cse7 |c_~#value~0.offset|))) (< (mod .cse4 4294967296) (mod (select (select (store (store (store (store .cse5 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse4 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select (store .cse9 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse6) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse10 4294967296) 1)))))))))))))) (not .cse16)) (or .cse16 (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| Int) (v_ArrVal_1071 Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse29 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_DerPreprocessor_35))) (let ((.cse25 (store .cse29 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072))) (let ((.cse30 (select .cse25 |c_~#value~0.base|))) (let ((.cse27 (select .cse30 |c_~#value~0.offset|))) (let ((.cse26 (store .cse30 |c_~#value~0.offset| (+ .cse27 1)))) (let ((.cse28 (select (store (store (store .cse29 |c_~#value~0.base| .cse26) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse20 (select .cse28 |c_~#value~0.offset|))) (let ((.cse22 (store .cse29 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33)) (.cse24 (store .cse28 |c_~#value~0.offset| (+ .cse20 1)))) (let ((.cse18 (store (store .cse22 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse24))) (let ((.cse17 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse19 (store (select .cse18 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1))) (or (not (= (select .cse17 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34|) 0)) (not (= (select (store (store .cse17 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store .cse18 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse19) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse20 4294967296) 1)) (let ((.cse23 (select (store (store (store .cse22 |c_~#value~0.base| .cse24) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse19) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse21 (select .cse23 |c_~#value~0.offset|))) (< (mod .cse21 4294967296) (mod (select (select (store (store (store (store .cse22 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse19) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| (+ .cse21 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (< (mod (select (select (store (store .cse25 |c_~#value~0.base| .cse26) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse27 4294967296) 1)))))))))))))))))) is different from false [2024-04-05 10:18:05,113 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array Int Int)) (v_ArrVal_1087 (Array Int Int)) (|v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| Int) (v_ArrVal_1071 Int) (|thr1Thread1of4ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1072 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_ArrVal_1086 Int) (|v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| Int) (v_ArrVal_1078 Int) (v_DerPreprocessor_33 (Array Int Int)) (|v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| Int)) (let ((.cse14 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse15 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse15 |c_~#value~0.offset| (+ 1 (select .cse15 |c_~#value~0.offset|))))))) (let ((.cse13 (store (select .cse14 |c_thr1Thread1of4ForFork0_~#casret~0#1.base|) |thr1Thread1of4ForFork0_~#casret~0#1.offset| 1))) (let ((.cse12 (select (store (store .cse14 |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base|))) (let ((.cse6 (select .cse12 |c_~#value~0.offset|))) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| .cse13)) (.cse5 (store .cse12 |c_~#value~0.offset| (+ .cse6 1)))) (let ((.cse11 (select (store (store (store .cse4 |c_~#value~0.base| .cse5) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base|))) (let ((.cse3 (select .cse11 |c_~#value~0.offset|))) (let ((.cse8 (store .cse4 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33)) (.cse10 (store .cse11 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse1 (store (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1079) |c_~#value~0.base| .cse10))) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of4ForFork0_~#casret~0#1.base| v_ArrVal_1071)) (.cse2 (store (select .cse1 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31|) 0 1))) (or (not (= (select .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34|) 0)) (not (= (select (store (store .cse0 |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_ArrVal_1078) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| v_ArrVal_1086) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26|) 0)) (< (mod (select (select (store .cse1 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)) (< (mod (select (select (store (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1072) |c_~#value~0.base| .cse5) |v_thr1Thread2of4ForFork0_~#casret~0#1.base_34| v_DerPreprocessor_33) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse6 4294967296) 1)) (let ((.cse9 (select (store (store (store .cse8 |c_~#value~0.base| .cse10) |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base|))) (let ((.cse7 (select .cse9 |c_~#value~0.offset|))) (< (mod .cse7 4294967296) (mod (select (select (store (store (store (store .cse8 |v_thr1Thread3of4ForFork0_~#casret~0#1.base_31| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1087) |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse7 1))) |v_thr1Thread4of4ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_30) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))))))))))) is different from false [2024-04-05 10:18:22,617 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 10:19:08,952 WARN L293 SmtUtils]: Spent 44.53s on a formula simplification. DAG size of input: 42 DAG size of output: 32 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-05 10:19:08,952 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-04-05 10:19:08,957 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 2121319 treesize of output 1984786 [2024-04-05 10:19:09,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:19:09,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26791 treesize of output 26753 [2024-04-05 10:19:10,361 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 6040 treesize of output 5828 [2024-04-05 10:19:10,463 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 9458 treesize of output 9140 [2024-04-05 10:19:10,678 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 5534 treesize of output 5150 [2024-04-05 10:19:10,813 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 3632 treesize of output 3312 [2024-04-05 10:19:10,977 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 152 treesize of output 140 [2024-04-05 10:19:11,309 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 7267 treesize of output 7265 [2024-04-05 10:19:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 9 refuted. 23 times theorem prover too weak. 0 trivial. 10 not checked. [2024-04-05 10:19:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548756996] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:19:20,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:19:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28, 30] total 70 [2024-04-05 10:19:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032956456] [2024-04-05 10:19:20,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:19:20,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-04-05 10:19:20,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:19:20,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-04-05 10:19:20,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=3411, Unknown=109, NotChecked=910, Total=4970 [2024-04-05 10:19:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:20,969 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:19:20,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 3.9857142857142858) internal successors, (279), 71 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:19:20,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:20,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:19:20,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:19:20,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:19:20,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-04-05 10:19:20,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 10:19:20,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-04-05 10:19:20,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-04-05 10:19:20,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:19:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:19:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:19:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-04-05 10:19:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 10:19:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-04-05 10:19:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-04-05 10:19:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-04-05 10:19:29,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-04-05 10:19:29,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-04-05 10:19:29,368 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-04-05 10:19:29,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:19:29,369 INFO L85 PathProgramCache]: Analyzing trace with hash -491038927, now seen corresponding path program 1 times [2024-04-05 10:19:29,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:19:29,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9627536] [2024-04-05 10:19:29,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:29,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:19:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 10:19:29,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 10:19:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 10:19:29,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 10:19:29,429 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 10:19:29,429 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-04-05 10:19:29,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-04-05 10:19:29,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2024-04-05 10:19:29,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-04-05 10:19:29,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-04-05 10:19:29,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-04-05 10:19:29,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-04-05 10:19:29,431 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-04-05 10:19:29,431 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-04-05 10:19:29,431 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-04-05 10:19:29,456 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 10:19:29,459 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 10:19:29,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 10:19:29,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:19:29,460 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 10:19:29,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-04-05 10:19:29,490 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 10:19:29,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:19:29,490 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 10:19:29,491 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@b87b5ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=2, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 10:19:29,491 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-04-05 10:19:29,497 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 10:19:29,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:19:29,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1616899814, now seen corresponding path program 1 times [2024-04-05 10:19:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:19:29,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605322606] [2024-04-05 10:19:29,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:29,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:19:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:19:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:19:29,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:19:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605322606] [2024-04-05 10:19:29,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605322606] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:19:29,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:19:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 10:19:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146373643] [2024-04-05 10:19:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:19:29,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 10:19:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:19:29,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 10:19:29,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 10:19:29,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:29,505 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:19:29,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:19:29,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:29,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-04-05 10:19:29,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 10:19:29,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:19:29,530 INFO L85 PathProgramCache]: Analyzing trace with hash -970814200, now seen corresponding path program 1 times [2024-04-05 10:19:29,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:19:29,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207043985] [2024-04-05 10:19:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:19:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:19:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-04-05 10:19:29,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:19:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207043985] [2024-04-05 10:19:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207043985] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:19:29,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:19:29,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-04-05 10:19:29,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444847040] [2024-04-05 10:19:29,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:19:29,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-04-05 10:19:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:19:29,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-04-05 10:19:29,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-04-05 10:19:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:29,671 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:19:29,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:19:29,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:29,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-04-05 10:19:29,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-04-05 10:19:29,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 10:19:29,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:19:29,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1108440751, now seen corresponding path program 1 times [2024-04-05 10:19:29,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:19:29,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860778297] [2024-04-05 10:19:29,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:29,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:19:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:19:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:19:30,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:19:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860778297] [2024-04-05 10:19:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860778297] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 10:19:30,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 10:19:30,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-04-05 10:19:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466178398] [2024-04-05 10:19:30,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 10:19:30,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-04-05 10:19:30,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:19:30,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-04-05 10:19:30,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-04-05 10:19:30,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:30,019 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:19:30,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:19:30,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:30,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-04-05 10:19:30,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:19:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:19:30,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-04-05 10:19:30,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 10:19:30,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:19:30,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1386114128, now seen corresponding path program 1 times [2024-04-05 10:19:30,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:19:30,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976560071] [2024-04-05 10:19:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:30,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:19:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:19:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-05 10:19:30,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:19:30,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976560071] [2024-04-05 10:19:30,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976560071] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:19:30,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520812892] [2024-04-05 10:19:30,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:30,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:19:30,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:19:30,846 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:19:30,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-04-05 10:19:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:19:31,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 10:19:31,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:19:31,097 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 10:19:31,097 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-04-05 10:19:31,153 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 16 treesize of output 11 [2024-04-05 10:19:31,344 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 10:19:31,345 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 2 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 10:19:31,506 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 10:19:31,506 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 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 10:19:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-05 10:19:31,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:19:35,841 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-04-05 10:19:35,842 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 33 [2024-04-05 10:19:35,848 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-04-05 10:19:35,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 10:19:35,854 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 7 treesize of output 5 [2024-04-05 10:19:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 52 proven. 3 refuted. 4 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-05 10:19:35,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520812892] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:19:35,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:19:35,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2024-04-05 10:19:35,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701627398] [2024-04-05 10:19:35,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:19:35,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-05 10:19:35,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:19:35,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-05 10:19:35,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=841, Unknown=11, NotChecked=0, Total=992 [2024-04-05 10:19:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:35,930 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:19:35,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.46875) internal successors, (175), 32 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:19:35,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:35,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:19:35,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:19:35,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:19:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:19:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-04-05 10:19:36,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-04-05 10:19:37,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-04-05 10:19:37,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 10:19:37,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:19:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash -755467422, now seen corresponding path program 1 times [2024-04-05 10:19:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:19:37,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567540915] [2024-04-05 10:19:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:37,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:19:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:19:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:19:37,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:19:37,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567540915] [2024-04-05 10:19:37,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567540915] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:19:37,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085708218] [2024-04-05 10:19:37,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:37,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:19:37,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:19:37,603 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:19:37,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-04-05 10:19:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:19:37,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2024-04-05 10:19:37,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:19:37,806 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 10:19:37,806 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 19 treesize of output 16 [2024-04-05 10:19:37,842 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:19:37,842 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-04-05 10:19:37,943 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-04-05 10:19:37,977 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 10:19:37,977 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-04-05 10:19:38,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 10:19:38,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2024-04-05 10:19:38,142 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-04-05 10:19:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 10:19:38,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:19:38,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:19:38,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 10:19:38,658 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 53 treesize of output 37 [2024-04-05 10:19:38,664 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 17 treesize of output 15 [2024-04-05 10:19:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 10:19:38,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085708218] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:19:38,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:19:38,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2024-04-05 10:19:38,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746007221] [2024-04-05 10:19:38,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:19:38,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-05 10:19:38,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:19:38,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-05 10:19:38,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=739, Unknown=6, NotChecked=0, Total=870 [2024-04-05 10:19:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:38,908 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:19:38,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.655172413793103) internal successors, (135), 30 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:19:38,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:38,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:19:38,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:19:38,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-04-05 10:19:38,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:19:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:19:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:19:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:19:39,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-04-05 10:19:40,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:19:40,096 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 10:19:40,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:19:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash 435043912, now seen corresponding path program 1 times [2024-04-05 10:19:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:19:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904150036] [2024-04-05 10:19:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:19:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:19:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 10:19:41,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:19:41,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904150036] [2024-04-05 10:19:41,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904150036] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:19:41,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987015302] [2024-04-05 10:19:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:41,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:19:41,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:19:41,178 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:19:41,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-04-05 10:19:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:19:41,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 46 conjunts are in the unsatisfiable core [2024-04-05 10:19:41,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:19:41,485 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 10:19:41,486 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-04-05 10:19:41,563 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 16 treesize of output 11 [2024-04-05 10:19:41,809 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-04-05 10:19:41,810 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 2 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 10:19:42,069 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 10:19:42,070 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 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 10:19:42,370 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 10:19:42,371 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 10:19:42,600 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 10:19:42,601 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 2 case distinctions, treesize of input 32 treesize of output 32 [2024-04-05 10:19:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-04-05 10:19:42,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:19:43,201 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1410 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 10:19:45,631 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (= (mod (select .cse12 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread1of5ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_ArrVal_1405 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_42))) (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (let ((.cse0 (select .cse4 |c_~#value~0.offset|))) (or (= 4294967295 (mod .cse0 4294967296)) (< (mod (select (select (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse0 1)))) (store (store .cse1 |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) .cse5) (or (forall ((v_ArrVal_1405 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| |c_thr1Thread1of5ForFork0_~vn~0#1|)))) (let ((.cse10 (store (select .cse11 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store (store .cse11 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse6 (select .cse9 |c_~#value~0.offset|))) (or (= 4294967295 (mod .cse6 4294967296)) (< (mod (select (select (store (let ((.cse7 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse10)) (.cse8 (store .cse9 |c_~#value~0.offset| (+ .cse6 1)))) (store (store .cse7 |c_~#value~0.base| .cse8) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse8) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) (not .cse5))))) is different from false [2024-04-05 10:19:45,676 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse7 (= (mod (select .cse6 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread1of5ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_ArrVal_1405 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ |c_thr1Thread1of5ForFork0_~v~0#1| 1))))) (let ((.cse4 (store (select .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store (store .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4)) (.cse1 (store .cse2 |c_~#value~0.offset| (+ .cse3 1)))) (store (store .cse0 |c_~#value~0.base| .cse1) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse1) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= 4294967295 (mod .cse3 4294967296)))))))) (not .cse7)) (or (forall ((v_ArrVal_1405 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse9 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_42))) (let ((.cse11 (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405))) (let ((.cse12 (select .cse11 |c_~#value~0.base|))) (let ((.cse8 (select .cse12 |c_~#value~0.offset|))) (or (= 4294967295 (mod .cse8 4294967296)) (< (mod (select (select (store (let ((.cse10 (store .cse12 |c_~#value~0.offset| (+ .cse8 1)))) (store (store .cse9 |c_~#value~0.base| .cse10) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store .cse11 |c_~#value~0.base| .cse10) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) .cse7)))) is different from false [2024-04-05 10:19:45,740 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ 1 (select .cse6 |c_~#value~0.offset|))))))) (let ((.cse4 (store (select .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base|) |c_thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store (store .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse0 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4)) (.cse1 (store .cse2 |c_~#value~0.offset| (+ .cse3 1)))) (store (store .cse0 |c_~#value~0.base| .cse1) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse1) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (= (mod .cse3 4294967296) 4294967295))))))) is different from false [2024-04-05 10:19:45,782 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1405 (Array Int Int)) (|thr1Thread1of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1410 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ 1 (select .cse6 |c_~#value~0.offset|))))))) (let ((.cse4 (store (select .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse3 (select (store (store .cse5 |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (or (= (mod .cse0 4294967296) 4294967295) (< (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |thr1Thread1of5ForFork0_~#casret~0#1.base| .cse4)) (.cse2 (store .cse3 |c_~#value~0.offset| (+ .cse0 1)))) (store (store .cse1 |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1405) |c_~#value~0.base| .cse2) |thr1Thread2of5ForFork0_~#casret~0#1.base|) |thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1410) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) is different from false [2024-04-05 10:19:46,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:19:46,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11529 treesize of output 11007 [2024-04-05 10:19:46,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 458 treesize of output 454 [2024-04-05 10:19:46,408 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 28 treesize of output 24 [2024-04-05 10:19:46,606 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-04-05 10:19:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 12 refuted. 20 times theorem prover too weak. 7 trivial. 28 not checked. [2024-04-05 10:19:48,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987015302] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:19:48,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:19:48,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 20] total 54 [2024-04-05 10:19:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904820818] [2024-04-05 10:19:48,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:19:48,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-04-05 10:19:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:19:48,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-04-05 10:19:48,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1969, Unknown=76, NotChecked=490, Total=2862 [2024-04-05 10:19:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:48,722 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:19:48,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.851851851851852) internal successors, (262), 54 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:19:48,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:48,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:19:48,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:19:48,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:19:48,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:19:48,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:19:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:19:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:19:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:19:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-04-05 10:19:51,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-04-05 10:19:51,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-04-05 10:19:51,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 10:19:51,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:19:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1686100594, now seen corresponding path program 1 times [2024-04-05 10:19:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:19:51,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161390256] [2024-04-05 10:19:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:19:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:19:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-05 10:19:52,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:19:52,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161390256] [2024-04-05 10:19:52,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161390256] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:19:52,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441340925] [2024-04-05 10:19:52,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:19:52,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:19:52,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:19:52,590 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:19:52,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-04-05 10:19:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:19:52,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 10:19:52,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:19:52,810 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:19:52,810 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-04-05 10:19:52,917 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 10:19:52,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 10:19:53,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 10:19:53,200 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-04-05 10:19:53,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-04-05 10:19:53,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-04-05 10:19:53,499 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 10:19:53,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 10:19:53,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 10:19:53,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2024-04-05 10:19:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 10:19:53,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:19:54,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:19:54,241 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 10:19:54,244 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 53 treesize of output 37 [2024-04-05 10:19:54,252 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 17 treesize of output 15 [2024-04-05 10:19:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-05 10:19:54,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441340925] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:19:54,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:19:54,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 35 [2024-04-05 10:19:54,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754758842] [2024-04-05 10:19:54,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:19:54,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-04-05 10:19:54,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:19:54,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-04-05 10:19:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1081, Unknown=2, NotChecked=0, Total=1260 [2024-04-05 10:19:54,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:54,657 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:19:54,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.571428571428571) internal successors, (195), 36 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:19:54,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:19:54,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:19:54,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:19:54,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:19:54,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:19:54,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-04-05 10:19:54,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:20:03,838 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-04-05 10:20:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:20:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:20:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:20:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:20:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:20:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 10:20:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 10:20:04,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-04-05 10:20:04,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:20:04,491 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 10:20:04,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:20:04,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1793026736, now seen corresponding path program 1 times [2024-04-05 10:20:04,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:20:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189801179] [2024-04-05 10:20:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:20:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:20:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:20:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 10:20:05,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:20:05,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189801179] [2024-04-05 10:20:05,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189801179] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:20:05,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600290446] [2024-04-05 10:20:05,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:20:05,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:20:05,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:20:05,953 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:20:05,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-04-05 10:20:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:20:06,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 61 conjunts are in the unsatisfiable core [2024-04-05 10:20:06,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:20:06,311 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-04-05 10:20:06,312 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-04-05 10:20:06,393 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 16 treesize of output 11 [2024-04-05 10:20:06,446 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-04-05 10:20:06,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-04-05 10:20:06,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-04-05 10:20:06,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-04-05 10:20:07,275 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 10:20:07,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 10:20:07,644 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 10:20:07,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 35 [2024-04-05 10:20:08,189 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-04-05 10:20:08,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 32 [2024-04-05 10:20:08,495 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-04-05 10:20:08,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 42 [2024-04-05 10:20:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 48 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-05 10:20:08,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:20:08,849 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1601 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) is different from false [2024-04-05 10:20:09,051 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1601 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)) (forall ((v_ArrVal_1600 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) is different from false [2024-04-05 10:20:09,141 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of5ForFork0_~v~0#1| 4294967296)))) (and (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_47))) (or (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (or (not .cse0) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread3of5ForFork0_~vn~0#1|)))) (store .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) is different from false [2024-04-05 10:20:09,175 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of5ForFork0_~v~0#1| 4294967296)))) (and (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_47))) (or (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ |c_thr1Thread3of5ForFork0_~v~0#1| 1))))) (store .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))))) (or (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) (not .cse0))))) is different from false [2024-04-05 10:20:09,551 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595))) (let ((.cse1 (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (store .cse3 |c_~#value~0.offset| (+ (select .cse3 |c_~#value~0.offset|) 1))))) (store (store |c_#memory_int| |c_~#value~0.base| .cse1) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store .cse2 |c_~#value~0.base| .cse1) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) is different from false [2024-04-05 10:20:21,434 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse12 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse12 |c_~#value~0.offset| (+ 1 (select .cse12 |c_~#value~0.offset|))))))) (let ((.cse10 (store (select .cse11 |c_thr1Thread1of5ForFork0_~#casret~0#1.base|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store (store .cse11 |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse3 (select .cse9 |c_~#value~0.offset|))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse10)) (.cse8 (store .cse9 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse1 (store (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base| .cse8))) (let ((.cse2 (store (select .cse1 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse0 (let ((.cse4 (store .cse7 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2)) (.cse5 (let ((.cse6 (select (store (store (store .cse7 |c_~#value~0.base| .cse8) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ (select .cse6 |c_~#value~0.offset|) 1))))) (store (store .cse4 |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1)))))))))))) is different from false [2024-04-05 10:20:26,414 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 10:21:04,528 WARN L293 SmtUtils]: Spent 31.31s on a formula simplification. DAG size of input: 64 DAG size of output: 37 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-04-05 10:21:04,528 INFO L349 Elim1Store]: treesize reduction 76, result has 41.5 percent of original size [2024-04-05 10:21:04,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 62089372 treesize of output 60347823 [2024-04-05 10:21:10,649 INFO L349 Elim1Store]: treesize reduction 124, result has 41.2 percent of original size [2024-04-05 10:21:10,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 69299 treesize of output 66859 [2024-04-05 10:21:11,500 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-04-05 10:21:11,501 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 3 case distinctions, treesize of input 12824 treesize of output 12622 [2024-04-05 10:21:11,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 10:21:11,995 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 10:21:12,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:21:12,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 5075 treesize of output 5107 [2024-04-05 10:21:12,309 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 5030 treesize of output 4744 [2024-04-05 10:21:12,449 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 300 treesize of output 264 [2024-04-05 10:21:12,599 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 372 treesize of output 312 [2024-04-05 10:21:13,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:21:13,064 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2024-04-05 10:21:13,110 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-04-05 10:21:15,078 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-04-05 10:21:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 15 refuted. 8 times theorem prover too weak. 0 trivial. 44 not checked. [2024-04-05 10:21:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600290446] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:21:16,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:21:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 27] total 74 [2024-04-05 10:21:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695326373] [2024-04-05 10:21:16,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:21:16,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-04-05 10:21:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:21:16,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-04-05 10:21:16,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=603, Invalid=3886, Unknown=91, NotChecked=822, Total=5402 [2024-04-05 10:21:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:21:16,051 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:21:16,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 4.162162162162162) internal successors, (308), 74 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:21:16,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:21:16,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:21:16,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:21:16,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:21:16,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:21:16,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 10:21:16,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 10:21:16,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:21:28,001 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse70 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse71 (select .cse70 |c_~#value~0.offset|))) (let ((.cse19 (mod .cse71 4294967296))) (let ((.cse13 (+ .cse19 1)) (.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse70 |c_~#value~0.offset| (+ 1 .cse71))))) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((|v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) 0)) (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse10 (store (select .cse11 |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store (store .cse11 |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse3 (select .cse9 |c_~#value~0.offset|))) (let ((.cse7 (store |c_#memory_int| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse10)) (.cse8 (store .cse9 |c_~#value~0.offset| (+ .cse3 1)))) (let ((.cse1 (store (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base| .cse8))) (let ((.cse2 (store (select .cse1 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse0 (let ((.cse4 (store .cse7 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2)) (.cse5 (let ((.cse6 (select (store (store (store .cse7 |c_~#value~0.base| .cse8) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse6 |c_~#value~0.offset| (+ (select .cse6 |c_~#value~0.offset|) 1))))) (store (store .cse4 |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse5) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse1 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse3 4294967296) 1))))))))))))) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse18 (store (select .cse11 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse12 (store .cse11 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse18))) (let ((.cse14 (let ((.cse15 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse18)) (.cse16 (let ((.cse17 (select (store .cse12 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse17 |c_~#value~0.offset| (+ (select .cse17 |c_~#value~0.offset|) 1))))) (store (store .cse15 |c_~#value~0.base| .cse16) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse15 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse16) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13) (< (mod (select (select (store .cse14 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse14 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))) (= (select |c_#valid| 3) 1) (or (< .cse19 (+ (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296) 1)) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (let ((.cse20 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595))) (let ((.cse21 (let ((.cse23 (select .cse22 |c_~#value~0.base|))) (store .cse23 |c_~#value~0.offset| (+ (select .cse23 |c_~#value~0.offset|) 1))))) (store (store |c_#memory_int| |c_~#value~0.base| .cse21) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store .cse22 |c_~#value~0.base| .cse21) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))))) (or (< (mod (select (select (store .cse20 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse20 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590))) (let ((.cse33 (select .cse32 |c_~#value~0.base|))) (let ((.cse26 (select .cse33 |c_~#value~0.offset|))) (let ((.cse31 (store .cse33 |c_~#value~0.offset| (+ .cse26 1)))) (let ((.cse24 (store .cse32 |c_~#value~0.base| .cse31))) (let ((.cse25 (store (select .cse24 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse27 (let ((.cse28 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse25)) (.cse29 (let ((.cse30 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse31) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse25) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse30 |c_~#value~0.offset| (+ (select .cse30 |c_~#value~0.offset|) 1))))) (store (store .cse28 |c_~#value~0.base| .cse29) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse28 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse29) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse24 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse25) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse26 4294967296) 1)) (< (mod (select (select (store .cse27 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse27 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))) (<= 0 (div |c_thr1Thread4of5ForFork0_~v~0#1| 4294967296)) (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1590 (Array Int Int)) (|v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| Int)) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1585))) (let ((.cse45 (let ((.cse47 (select .cse46 |c_~#value~0.base|))) (store .cse47 |c_~#value~0.offset| (+ (select .cse47 |c_~#value~0.offset|) 1))))) (let ((.cse44 (store (select (store .cse46 |c_~#value~0.base| .cse45) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse43 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse45) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse44) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse36 (select .cse43 |c_~#value~0.offset|))) (let ((.cse41 (store |c_#memory_int| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse44)) (.cse42 (store .cse43 |c_~#value~0.offset| (+ .cse36 1)))) (let ((.cse34 (store (store .cse41 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1590) |c_~#value~0.base| .cse42))) (let ((.cse35 (store (select .cse34 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse37 (let ((.cse38 (store .cse41 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse35)) (.cse39 (let ((.cse40 (select (store (store (store .cse41 |c_~#value~0.base| .cse42) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse35) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse40 |c_~#value~0.offset| (+ (select .cse40 |c_~#value~0.offset|) 1))))) (store (store .cse38 |c_~#value~0.base| .cse39) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse38 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse39) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse34 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse35) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse36 4294967296) 1)) (< (mod (select (select (store .cse37 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse37 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (not (= (select |c_#valid| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) 0))))))))))))) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (< .cse19 4294967295) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int))) (let ((.cse48 (store .cse11 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse11 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1)))) (or (< (mod (select (select (store .cse48 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse48 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (<= |c_thr1Thread4of5ForFork0_~v~0#1| 3) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1595 (Array Int Int))) (let ((.cse54 (store (select .cse11 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse50 (store .cse11 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse54))) (let ((.cse49 (let ((.cse51 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse54)) (.cse52 (let ((.cse53 (select (store .cse50 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse53 |c_~#value~0.offset| (+ (select .cse53 |c_~#value~0.offset|) 1))))) (store (store .cse51 |c_~#value~0.base| .cse52) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse51 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) |c_~#value~0.base| .cse52) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (< (mod (select (select (store .cse49 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse49 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse50 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13)))))) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int))) (let ((.cse55 (store .cse11 |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select .cse11 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1)))) (or (< (mod (select (select (store .cse55 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse55 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))) (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1600 (Array Int Int)) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1585 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (|v_ULTIMATE.start_main_~#t~0#1.base_105| Int) (v_ArrVal_1590 (Array Int Int)) (|v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| Int)) (let ((.cse68 (store |c_#memory_int| |v_ULTIMATE.start_main_~#t~0#1.base_105| v_ArrVal_1585))) (let ((.cse67 (let ((.cse69 (select .cse68 |c_~#value~0.base|))) (store .cse69 |c_~#value~0.offset| (+ (select .cse69 |c_~#value~0.offset|) 1))))) (let ((.cse66 (store (select (store .cse68 |c_~#value~0.base| .cse67) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse65 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse67) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse66) |v_ULTIMATE.start_main_~#t~0#1.base_105| v_ArrVal_1590) |c_~#value~0.base|))) (let ((.cse59 (select .cse65 |c_~#value~0.offset|))) (let ((.cse63 (store |c_#memory_int| |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32| .cse66)) (.cse64 (store .cse65 |c_~#value~0.offset| (+ .cse59 1)))) (let ((.cse57 (store (store .cse63 |v_ULTIMATE.start_main_~#t~0#1.base_105| v_ArrVal_1590) |c_~#value~0.base| .cse64))) (let ((.cse58 (store (select .cse57 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse56 (let ((.cse60 (store .cse63 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse58)) (.cse61 (let ((.cse62 (select (store (store (store .cse63 |c_~#value~0.base| .cse64) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse58) |v_ULTIMATE.start_main_~#t~0#1.base_105| v_ArrVal_1595) |c_~#value~0.base|))) (store .cse62 |c_~#value~0.offset| (+ (select .cse62 |c_~#value~0.offset|) 1))))) (store (store .cse60 |c_~#value~0.base| .cse61) |thr1Thread3of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse60 |v_ULTIMATE.start_main_~#t~0#1.base_105| v_ArrVal_1595) |c_~#value~0.base| .cse61) |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#t~0#1.base_105| 1) |v_thr1Thread1of5ForFork0_~#casret~0#1.base_32|) 0)) (< (mod (select (select (store .cse56 |v_ULTIMATE.start_main_~#t~0#1.base_105| v_ArrVal_1600) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse56 |v_ULTIMATE.start_main_~#t~0#1.base_105| v_ArrVal_1601) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse57 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse58) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse59 4294967296) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t~0#1.base_105|) 0)))))))))))))))))) is different from true [2024-04-05 10:21:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:21:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:21:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:21:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:21:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:21:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 10:21:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 10:21:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-04-05 10:21:29,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-04-05 10:21:30,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-04-05 10:21:30,014 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 10:21:30,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:21:30,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1163445853, now seen corresponding path program 1 times [2024-04-05 10:21:30,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:21:30,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675166218] [2024-04-05 10:21:30,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:21:30,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:21:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:21:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-04-05 10:21:30,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:21:30,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675166218] [2024-04-05 10:21:30,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675166218] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:21:30,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741417045] [2024-04-05 10:21:30,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:21:30,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:21:30,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:21:30,658 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:21:30,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-04-05 10:21:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:21:30,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-05 10:21:30,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:21:30,964 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 10:21:30,964 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 19 treesize of output 16 [2024-04-05 10:21:31,015 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 10:21:31,016 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 19 treesize of output 16 [2024-04-05 10:21:31,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-04-05 10:21:31,170 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 10:21:31,171 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 19 treesize of output 16 [2024-04-05 10:21:31,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-04-05 10:21:31,311 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 10:21:31,311 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 19 treesize of output 16 [2024-04-05 10:21:31,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-04-05 10:21:31,413 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 10:21:31,414 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-04-05 10:21:31,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2024-04-05 10:21:31,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 66 [2024-04-05 10:21:31,568 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-04-05 10:21:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-04-05 10:21:31,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:21:31,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 10:21:31,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 30 [2024-04-05 10:21:31,965 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 53 treesize of output 37 [2024-04-05 10:21:31,971 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 17 treesize of output 15 [2024-04-05 10:21:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-04-05 10:21:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741417045] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 10:21:32,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 10:21:32,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2024-04-05 10:21:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373892185] [2024-04-05 10:21:32,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 10:21:32,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-04-05 10:21:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 10:21:32,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-04-05 10:21:32,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=790, Unknown=2, NotChecked=0, Total=930 [2024-04-05 10:21:32,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:21:32,338 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 10:21:32,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 8.066666666666666) internal successors, (242), 31 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 10:21:32,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:21:32,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:21:32,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:21:32,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:21:32,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:21:32,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 10:21:32,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 10:21:32,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-04-05 10:21:32,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:21:35,515 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-04-05 10:21:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 10:21:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 10:21:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 10:21:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-05 10:21:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-05 10:21:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 10:21:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 10:21:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-05 10:21:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-04-05 10:21:36,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-04-05 10:21:36,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-04-05 10:21:36,362 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-04-05 10:21:36,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 10:21:36,362 INFO L85 PathProgramCache]: Analyzing trace with hash 614498696, now seen corresponding path program 1 times [2024-04-05 10:21:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 10:21:36,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402957172] [2024-04-05 10:21:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:21:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 10:21:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:21:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:21:38,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 10:21:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402957172] [2024-04-05 10:21:38,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402957172] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 10:21:38,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940711965] [2024-04-05 10:21:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 10:21:38,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 10:21:38,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 10:21:38,395 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 10:21:38,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-04-05 10:21:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 10:21:38,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 66 conjunts are in the unsatisfiable core [2024-04-05 10:21:38,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 10:21:38,760 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-04-05 10:21:38,761 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 19 treesize of output 16 [2024-04-05 10:21:38,855 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 16 treesize of output 11 [2024-04-05 10:21:38,906 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-05 10:21:38,906 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-04-05 10:21:39,080 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 35 treesize of output 18 [2024-04-05 10:21:39,307 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-04-05 10:21:39,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 10:21:39,591 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 10:21:39,591 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 10:21:39,847 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 10:21:39,848 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 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 10:21:40,153 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 10:21:40,153 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 10:21:40,445 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 10:21:40,445 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 2 case distinctions, treesize of input 23 treesize of output 25 [2024-04-05 10:21:40,797 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-04-05 10:21:40,798 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 2 case distinctions, treesize of input 35 treesize of output 22 [2024-04-05 10:21:41,025 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-04-05 10:21:41,026 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 2 case distinctions, treesize of input 32 treesize of output 32 [2024-04-05 10:21:41,175 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 23 treesize of output 11 [2024-04-05 10:21:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 10:21:41,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 10:21:41,833 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread4of5ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (forall ((|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1828 (Array Int Int))) (< (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread4of5ForFork0_~v~0#1| 1))))) (store .cse1 |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select .cse1 |thr1Thread4of5ForFork0_~#casret~0#1.base|) |c_thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))) (or .cse0 (forall ((v_DerPreprocessor_54 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1828 (Array Int Int))) (< (mod (select (select (store (store |c_#memory_int| |thr1Thread4of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))) is different from false [2024-04-05 10:21:44,576 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread3of5ForFork0_~v~0#1| 4294967296))) (let ((.cse0 (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) .cse12)) (.cse2 (+ .cse12 1))) (and (or (not .cse0) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| |c_thr1Thread3of5ForFork0_~vn~0#1|)))) (let ((.cse4 (store (select .cse6 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (select (store .cse6 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse4) |c_~#value~0.base|))) (let ((.cse1 (select .cse5 |c_~#value~0.offset|))) (or (< (mod .cse1 4294967296) .cse2) (< (mod (select (select (store (let ((.cse3 (store (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse4) |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ .cse1 1))))) (store .cse3 |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))) (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_55 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_55))) (let ((.cse11 (select .cse10 |c_~#value~0.base|))) (let ((.cse8 (select .cse11 |c_~#value~0.offset|))) (or (< (mod .cse8 4294967296) .cse2) (< (mod (select (select (store (let ((.cse9 (store .cse10 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse8 1))))) (store .cse9 |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select .cse9 |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))) is different from false [2024-04-05 10:21:44,653 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (mod |c_thr1Thread3of5ForFork0_~v~0#1| 4294967296))) (let ((.cse0 (= (mod (select .cse11 |c_~#value~0.offset|) 4294967296) .cse12)) (.cse2 (+ .cse12 1))) (and (or .cse0 (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_55 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_55))) (let ((.cse5 (select .cse4 |c_~#value~0.base|))) (let ((.cse1 (select .cse5 |c_~#value~0.offset|))) (or (< (mod .cse1 4294967296) .cse2) (< (mod (select (select (store (let ((.cse3 (store .cse4 |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ .cse1 1))))) (store .cse3 |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select .cse3 |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))) (or (not .cse0) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ |c_thr1Thread3of5ForFork0_~v~0#1| 1))))) (let ((.cse8 (store (select .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base|) |c_thr1Thread3of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base|))) (let ((.cse6 (select .cse9 |c_~#value~0.offset|))) (or (< (mod .cse6 4294967296) .cse2) (< (mod (select (select (store (let ((.cse7 (store (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse6 1))))) (store .cse7 |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select .cse7 |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))))) is different from false [2024-04-05 10:21:48,097 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse7 (select .cse2 |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (let ((.cse6 (store .cse2 |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ .cse5 1))))) (let ((.cse0 (store (select .cse6 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse3 (select (store .cse6 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base|))) (let ((.cse4 (select .cse3 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse1 (store .cse3 |c_~#value~0.offset| (+ .cse4 1)))) (store (store (store |c_#memory_int| |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base| .cse1) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse2 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base| .cse1) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse4 4294967296) (+ (mod .cse5 4294967296) 1))))))))))) is different from false [2024-04-05 10:21:50,827 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|)) (.cse24 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse3 (+ .cse24 1)) (.cse14 (= (mod (select .cse13 |c_~#value~0.offset|) 4294967296) .cse24))) (and (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| |c_thr1Thread2of5ForFork0_~vn~0#1|)))) (let ((.cse11 (store (select .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse10 (select (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse4 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse7 (store .cse4 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse1 (select .cse10 |c_~#value~0.offset|))) (let ((.cse9 (store .cse7 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse5 (store (select .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse8 (select (store .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base|))) (let ((.cse0 (select .cse8 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< (mod (select (select (store (let ((.cse6 (store .cse8 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store .cse4 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base| .cse6) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse7 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base| .cse6) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295)))))))))))) (not .cse14)) (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse18 (store .cse15 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse23 (select .cse18 |c_~#value~0.base|))) (let ((.cse21 (select .cse23 |c_~#value~0.offset|))) (let ((.cse22 (store .cse18 |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| (+ .cse21 1))))) (let ((.cse16 (store (select .cse22 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse19 (select (store .cse22 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse16) |c_~#value~0.base|))) (let ((.cse20 (select .cse19 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse17 (store .cse19 |c_~#value~0.offset| (+ .cse20 1)))) (store (store (store .cse15 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse16) |c_~#value~0.base| .cse17) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse18 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse16) |c_~#value~0.base| .cse17) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse20 4294967296) (+ (mod .cse21 4294967296) 1)) (< (mod (select (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3))))))))))) .cse14)))) is different from false [2024-04-05 10:21:50,922 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_int| |c_~#value~0.base|)) (.cse24 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (let ((.cse10 (= (mod (select .cse23 |c_~#value~0.offset|) 4294967296) .cse24)) (.cse7 (+ .cse24 1))) (and (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse9 (select .cse3 |c_~#value~0.base|))) (let ((.cse6 (select .cse9 |c_~#value~0.offset|))) (let ((.cse8 (store .cse3 |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| (+ .cse6 1))))) (let ((.cse1 (store (select .cse8 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse4 (select (store .cse8 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse5 1)))) (store (store (store .cse0 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse5 4294967296) (+ (mod .cse6 4294967296) 1)) (< (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse7))))))))))) .cse10) (or (not .cse10) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (let ((.cse21 (store (select .cse22 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse18 (store .cse22 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse21))) (let ((.cse20 (select (store .cse18 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse13 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse21))) (let ((.cse16 (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse12 (select .cse20 |c_~#value~0.offset|))) (let ((.cse19 (store .cse16 |c_~#value~0.base| (store .cse20 |c_~#value~0.offset| (+ .cse12 1))))) (let ((.cse14 (store (select .cse19 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse17 (select (store .cse19 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base|))) (let ((.cse11 (select .cse17 |c_~#value~0.offset|))) (or (< (mod .cse11 4294967296) (+ (mod .cse12 4294967296) 1)) (< (mod (select (select (store (let ((.cse15 (store .cse17 |c_~#value~0.offset| (+ .cse11 1)))) (store (store (store .cse13 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base| .cse15) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse16 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse14) |c_~#value~0.base| .cse15) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse7)))))))))))))))) is different from false [2024-04-05 10:21:51,032 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of5ForFork0_~v~0#1| 4294967296))) (or (= 4294967295 .cse0) (let ((.cse24 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse11 (= (mod (select .cse24 |c_~#value~0.offset|) 4294967296) .cse0)) (.cse8 (+ .cse0 1))) (and (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| v_DerPreprocessor_56))) (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819))) (let ((.cse10 (select .cse4 |c_~#value~0.base|))) (let ((.cse7 (select .cse10 |c_~#value~0.offset|))) (let ((.cse9 (store .cse4 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse7 1))))) (let ((.cse2 (store (select .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse5 (select (store .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base|))) (let ((.cse6 (select .cse5 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse3 (store .cse5 |c_~#value~0.offset| (+ .cse6 1)))) (store (store (store .cse1 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .cse3) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse2) |c_~#value~0.base| .cse3) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse6 4294967296) (+ (mod .cse7 4294967296) 1)) (< (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse8))))))))))) .cse11) (or (not .cse11) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_~#value~0.base| (store .cse24 |c_~#value~0.offset| (+ 1 |c_thr1Thread2of5ForFork0_~v~0#1|))))) (let ((.cse22 (store (select .cse23 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse19 (store .cse23 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse22))) (let ((.cse21 (select (store .cse19 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse14 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse22))) (let ((.cse17 (store .cse14 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse13 (select .cse21 |c_~#value~0.offset|))) (let ((.cse20 (store .cse17 |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| (+ .cse13 1))))) (let ((.cse15 (store (select .cse20 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse18 (select (store .cse20 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse15) |c_~#value~0.base|))) (let ((.cse12 (select .cse18 |c_~#value~0.offset|))) (or (< (mod .cse12 4294967296) (+ (mod .cse13 4294967296) 1)) (< (mod (select (select (store (let ((.cse16 (store .cse18 |c_~#value~0.offset| (+ .cse12 1)))) (store (store (store .cse14 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse15) |c_~#value~0.base| .cse16) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse17 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse15) |c_~#value~0.base| .cse16) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse8)))))))))))))))))) is different from false [2024-04-05 10:21:51,099 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse14 (select .cse13 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse14 4294967296))) (or (= .cse0 4294967295) (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| (+ 1 .cse14))))) (let ((.cse11 (store (select .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base|) |c_thr1Thread2of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse1 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse10 (select (store .cse1 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse2 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse8 (select .cse10 |c_~#value~0.offset|))) (let ((.cse9 (store .cse5 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse8 1))))) (let ((.cse3 (store (select .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse6 (select (store .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|))) (let ((.cse7 (select .cse6 |c_~#value~0.offset|))) (or (< (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ .cse0 1)) (< (mod (select (select (store (let ((.cse4 (store .cse6 |c_~#value~0.offset| (+ .cse7 1)))) (store (store (store .cse2 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse5 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse7 4294967296) (+ (mod .cse8 4294967296) 1))))))))))))))))) is different from false [2024-04-05 10:21:51,258 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse14 (select .cse13 |c_~#value~0.offset|))) (let ((.cse1 (mod .cse14 4294967296))) (or (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| (+ 1 .cse14))))) (let ((.cse11 (store (select .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse0 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse10 (select (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse2 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse11))) (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse8 (select .cse10 |c_~#value~0.offset|))) (let ((.cse9 (store .cse5 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse8 1))))) (let ((.cse3 (store (select .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse6 (select (store .cse9 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|))) (let ((.cse7 (select .cse6 |c_~#value~0.offset|))) (or (< (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ .cse1 1)) (< (mod (select (select (store (let ((.cse4 (store .cse6 |c_~#value~0.offset| (+ .cse7 1)))) (store (store (store .cse2 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse5 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base| .cse4) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod .cse7 4294967296) (+ (mod .cse8 4294967296) 1))))))))))))) (= .cse1 4294967295))))) is different from false [2024-04-05 10:21:51,478 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (v_ArrVal_1814 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1814))) (let ((.cse14 (select .cse13 |c_~#value~0.base|))) (let ((.cse4 (select .cse14 |c_~#value~0.offset|))) (let ((.cse12 (store .cse14 |c_~#value~0.offset| (+ .cse4 1)))) (let ((.cse2 (store .cse13 |c_~#value~0.base| .cse12))) (let ((.cse3 (store (select .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_~#value~0.base| .cse12) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse5 (store |c_#memory_int| |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3))) (let ((.cse8 (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse1 (select .cse11 |c_~#value~0.offset|))) (let ((.cse10 (store .cse8 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse1 1))))) (let ((.cse6 (store (select .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse9 (select (store .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base|))) (let ((.cse0 (select .cse9 |c_~#value~0.offset|))) (or (< (mod .cse0 4294967296) (+ (mod .cse1 4294967296) 1)) (< (mod (select (select (store .cse2 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse3) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse4 4294967296) 1)) (< (mod (select (select (store (let ((.cse7 (store .cse9 |c_~#value~0.offset| (+ .cse0 1)))) (store (store (store .cse5 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| .cse7) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse8 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| .cse7) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295))))))))))))))) is different from false [2024-04-05 10:21:56,635 WARN L854 $PredicateComparison]: unable to prove that (forall ((|thr1Thread1of5ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread2of5ForFork0_~#casret~0#1.base| Int) (|thr1Thread4of5ForFork0_~#casret~0#1.base| Int) (v_ArrVal_1819 (Array Int Int)) (|thr1Thread4of5ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_1828 (Array Int Int)) (v_ArrVal_1814 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse17 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse17 |c_~#value~0.offset| (+ 1 (select .cse17 |c_~#value~0.offset|))))))) (let ((.cse15 (store (select .cse16 |c_thr1Thread1of5ForFork0_~#casret~0#1.base|) |thr1Thread1of5ForFork0_~#casret~0#1.offset| 1))) (let ((.cse14 (select (store (store .cse16 |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1814) |c_~#value~0.base|))) (let ((.cse8 (select .cse14 |c_~#value~0.offset|))) (let ((.cse12 (store |c_#memory_int| |c_thr1Thread1of5ForFork0_~#casret~0#1.base| .cse15)) (.cse13 (store .cse14 |c_~#value~0.offset| (+ .cse8 1)))) (let ((.cse6 (store (store .cse12 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1814) |c_~#value~0.base| .cse13))) (let ((.cse7 (store (select .cse6 |thr1Thread2of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse11 (select (store (store (store .cse12 |c_~#value~0.base| .cse13) |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819) |c_~#value~0.base|)) (.cse0 (store .cse12 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse7))) (let ((.cse3 (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1819)) (.cse9 (select .cse11 |c_~#value~0.offset|))) (let ((.cse10 (store .cse3 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| (+ .cse9 1))))) (let ((.cse1 (store (select .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base|) 0 1))) (let ((.cse4 (select (store .cse10 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (or (< (mod (select (select (store (let ((.cse2 (store .cse4 |c_~#value~0.offset| (+ .cse5 1)))) (store (store (store .cse0 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread4of5ForFork0_~#casret~0#1.base| (store (select (store (store .cse3 |thr1Thread3of5ForFork0_~#casret~0#1.base| .cse1) |c_~#value~0.base| .cse2) |thr1Thread4of5ForFork0_~#casret~0#1.base|) |thr1Thread4of5ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1828) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) 4294967295) (< (mod (select (select (store .cse6 |thr1Thread2of5ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (+ (mod .cse8 4294967296) 1)) (< (mod .cse5 4294967296) (+ (mod .cse9 4294967296) 1))))))))))))))))) is different from false