/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 50 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 15:50:11,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 15:50:11,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 15:50:11,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 15:50:11,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 15:50:11,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 15:50:11,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 15:50:11,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 15:50:11,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 15:50:11,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 15:50:11,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 15:50:11,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 15:50:11,960 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 15:50:11,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 15:50:11,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 15:50:11,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 15:50:11,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 15:50:11,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 15:50:11,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 15:50:11,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 15:50:11,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 15:50:11,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 15:50:11,967 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 15:50:11,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 15:50:11,967 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 15:50:11,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 15:50:11,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 15:50:11,967 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 15:50:11,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 15:50:11,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 15:50:11,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 15:50:11,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 15:50:11,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 15:50:11,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 15:50:11,970 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 15:50:11,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 15:50:11,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 15:50:11,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 15:50:11,970 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 15:50:11,970 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 -> 50 [2024-04-05 15:50:12,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 15:50:12,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 15:50:12,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 15:50:12,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 15:50:12,246 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 15:50:12,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2024-04-05 15:50:13,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 15:50:13,640 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 15:50:13,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2024-04-05 15:50:13,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/54dad6a7c/128ff342724b4528a39815228dbe6441/FLAG363bae78b [2024-04-05 15:50:13,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/54dad6a7c/128ff342724b4528a39815228dbe6441 [2024-04-05 15:50:13,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 15:50:13,694 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 15:50:13,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 15:50:13,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 15:50:13,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 15:50:13,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 03:50:13" (1/1) ... [2024-04-05 15:50:13,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d25862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:13, skipping insertion in model container [2024-04-05 15:50:13,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 03:50:13" (1/1) ... [2024-04-05 15:50:13,778 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 15:50:14,122 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/queue_ok.i[43266,43279] [2024-04-05 15:50:14,129 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/queue_ok.i[43543,43556] [2024-04-05 15:50:14,137 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 15:50:14,149 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 15:50:14,206 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/queue_ok.i[43266,43279] [2024-04-05 15:50:14,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/queue_ok.i[43543,43556] [2024-04-05 15:50:14,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 15:50:14,255 INFO L206 MainTranslator]: Completed translation [2024-04-05 15:50:14,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14 WrapperNode [2024-04-05 15:50:14,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 15:50:14,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 15:50:14,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 15:50:14,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 15:50:14,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (1/1) ... [2024-04-05 15:50:14,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (1/1) ... [2024-04-05 15:50:14,302 INFO L138 Inliner]: procedures = 275, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2024-04-05 15:50:14,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 15:50:14,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 15:50:14,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 15:50:14,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 15:50:14,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (1/1) ... [2024-04-05 15:50:14,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (1/1) ... [2024-04-05 15:50:14,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (1/1) ... [2024-04-05 15:50:14,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (1/1) ... [2024-04-05 15:50:14,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (1/1) ... [2024-04-05 15:50:14,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (1/1) ... [2024-04-05 15:50:14,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (1/1) ... [2024-04-05 15:50:14,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (1/1) ... [2024-04-05 15:50:14,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 15:50:14,330 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 15:50:14,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 15:50:14,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 15:50:14,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (1/1) ... [2024-04-05 15:50:14,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 15:50:14,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:50:14,375 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 15:50:14,401 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 15:50:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-04-05 15:50:14,436 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-04-05 15:50:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-04-05 15:50:14,436 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-04-05 15:50:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 15:50:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 15:50:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-04-05 15:50:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 15:50:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 15:50:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-04-05 15:50:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 15:50:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 15:50:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 15:50:14,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 15:50:14,439 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 15:50:14,594 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 15:50:14,596 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 15:50:14,889 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 15:50:14,907 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 15:50:14,907 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-05 15:50:14,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 03:50:14 BoogieIcfgContainer [2024-04-05 15:50:14,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 15:50:14,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 15:50:14,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 15:50:14,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 15:50:14,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 03:50:13" (1/3) ... [2024-04-05 15:50:14,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f918dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 03:50:14, skipping insertion in model container [2024-04-05 15:50:14,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 03:50:14" (2/3) ... [2024-04-05 15:50:14,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f918dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 03:50:14, skipping insertion in model container [2024-04-05 15:50:14,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 03:50:14" (3/3) ... [2024-04-05 15:50:14,915 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2024-04-05 15:50:14,922 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 15:50:14,932 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 15:50:14,932 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-04-05 15:50:14,933 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 15:50:15,054 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 15:50:15,094 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 15:50:15,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 15:50:15,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:50:15,097 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 15:50:15,115 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 15:50:15,142 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 15:50:15,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:15,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 15:50:15,160 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;@38fcf201, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=50, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-05 15:50:15,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-05 15:50:15,198 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:15,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1100909939, now seen corresponding path program 1 times [2024-04-05 15:50:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:15,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682305260] [2024-04-05 15:50:15,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:15,453 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 15:50:15,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:50:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682305260] [2024-04-05 15:50:15,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682305260] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 15:50:15,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 15:50:15,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 15:50:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780207859] [2024-04-05 15:50:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 15:50:15,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 15:50:15,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:50:15,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 15:50:15,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 15:50:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:15,481 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:50:15,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 15:50:15,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:15,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:15,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 15:50:15,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:15,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:15,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1323198379, now seen corresponding path program 1 times [2024-04-05 15:50:15,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:15,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708020000] [2024-04-05 15:50:15,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:15,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:16,108 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 15:50:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:50:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708020000] [2024-04-05 15:50:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708020000] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 15:50:16,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 15:50:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 15:50:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924613832] [2024-04-05 15:50:16,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 15:50:16,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 15:50:16,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:50:16,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 15:50:16,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 15:50:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:16,116 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:50:16,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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 15:50:16,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:16,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:16,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 15:50:16,268 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:16,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2002901627, now seen corresponding path program 1 times [2024-04-05 15:50:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:16,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117297706] [2024-04-05 15:50:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:16,362 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 15:50:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:50:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117297706] [2024-04-05 15:50:16,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117297706] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 15:50:16,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 15:50:16,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 15:50:16,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505924234] [2024-04-05 15:50:16,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 15:50:16,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 15:50:16,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:50:16,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 15:50:16,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 15:50:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:16,364 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:50:16,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 15:50:16,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:16,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:16,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:16,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:16,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:16,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 15:50:16,402 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:16,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:16,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1898140429, now seen corresponding path program 1 times [2024-04-05 15:50:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:16,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683954823] [2024-04-05 15:50:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:16,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:50:16,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683954823] [2024-04-05 15:50:16,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683954823] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:50:16,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998654384] [2024-04-05 15:50:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:16,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:16,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:50:16,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 15:50:16,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-05 15:50:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:16,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 4 conjunts are in the unsatisfiable core [2024-04-05 15:50:16,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:50:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:16,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 15:50:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:17,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998654384] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 15:50:17,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 15:50:17,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-04-05 15:50:17,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289500515] [2024-04-05 15:50:17,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 15:50:17,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-04-05 15:50:17,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:50:17,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-04-05 15:50:17,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-04-05 15:50:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:17,068 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:50:17,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.6) internal successors, (256), 10 states have internal predecessors, (256), 0 states have call successors, (0), 0 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 15:50:17,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:17,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:17,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:17,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:17,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-05 15:50:17,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:17,378 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:17,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:17,379 INFO L85 PathProgramCache]: Analyzing trace with hash 44387869, now seen corresponding path program 2 times [2024-04-05 15:50:17,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:17,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233592854] [2024-04-05 15:50:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:17,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:17,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:50:17,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233592854] [2024-04-05 15:50:17,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233592854] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:50:17,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501265983] [2024-04-05 15:50:17,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 15:50:17,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:17,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:50:17,690 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 15:50:17,724 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 15:50:17,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-04-05 15:50:17,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 15:50:17,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2024-04-05 15:50:17,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:50:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-04-05 15:50:17,886 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 15:50:17,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501265983] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 15:50:17,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 15:50:17,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-04-05 15:50:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781027315] [2024-04-05 15:50:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 15:50:17,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-05 15:50:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:50:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-05 15:50:17,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-04-05 15:50:17,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:17,892 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:50:17,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 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 15:50:17,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:17,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:17,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:17,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:17,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:17,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:17,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:17,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:17,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:17,950 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 15:50:18,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:18,149 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:18,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash 26985882, now seen corresponding path program 1 times [2024-04-05 15:50:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:18,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599138626] [2024-04-05 15:50:18,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:18,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:18,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:50:18,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599138626] [2024-04-05 15:50:18,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599138626] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:50:18,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677872500] [2024-04-05 15:50:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:18,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:18,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:50:18,387 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 15:50:18,416 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 15:50:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:18,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 8 conjunts are in the unsatisfiable core [2024-04-05 15:50:18,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:50:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:18,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 15:50:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:18,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677872500] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 15:50:18,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 15:50:18,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-04-05 15:50:18,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609707689] [2024-04-05 15:50:18,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 15:50:18,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-04-05 15:50:18,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:50:18,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-04-05 15:50:18,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-04-05 15:50:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:18,903 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:50:18,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.27777777777778) internal successors, (383), 18 states have internal predecessors, (383), 0 states have call successors, (0), 0 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 15:50:18,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:18,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:18,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:18,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:18,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:18,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:50:19,124 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 15:50:19,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:19,310 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:19,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:19,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1417540742, now seen corresponding path program 2 times [2024-04-05 15:50:19,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:19,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903944499] [2024-04-05 15:50:19,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:19,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:19,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:50:19,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903944499] [2024-04-05 15:50:19,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903944499] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:50:19,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026969117] [2024-04-05 15:50:19,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 15:50:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:19,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:50:19,859 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 15:50:19,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-04-05 15:50:20,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 15:50:20,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 15:50:20,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 16 conjunts are in the unsatisfiable core [2024-04-05 15:50:20,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:50:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:20,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 15:50:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:20,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026969117] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 15:50:20,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 15:50:20,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-04-05 15:50:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99159855] [2024-04-05 15:50:20,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 15:50:20,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-04-05 15:50:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:50:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-04-05 15:50:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-04-05 15:50:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:20,745 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:50:20,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 18.794117647058822) internal successors, (639), 34 states have internal predecessors, (639), 0 states have call successors, (0), 0 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 15:50:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:50:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:50:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 15:50:21,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-04-05 15:50:21,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-04-05 15:50:21,499 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:21,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash -124479686, now seen corresponding path program 3 times [2024-04-05 15:50:21,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:21,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521746943] [2024-04-05 15:50:21,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:21,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 0 proven. 3375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:50:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521746943] [2024-04-05 15:50:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521746943] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:50:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310696966] [2024-04-05 15:50:23,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-05 15:50:23,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:23,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:50:23,138 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 15:50:23,163 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 15:50:23,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-04-05 15:50:23,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 15:50:23,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 73 conjunts are in the unsatisfiable core [2024-04-05 15:50:23,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:50:25,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-05 15:50:25,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:50:25,513 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 15:50:25,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:50:25,702 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 27 treesize of output 11 [2024-04-05 15:50:25,747 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 23 treesize of output 11 [2024-04-05 15:50:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3375 backedges. 801 proven. 0 refuted. 0 times theorem prover too weak. 2574 trivial. 0 not checked. [2024-04-05 15:50:25,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 15:50:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310696966] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 15:50:25,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 15:50:25,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [33] total 44 [2024-04-05 15:50:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611856912] [2024-04-05 15:50:25,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 15:50:25,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-04-05 15:50:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:50:25,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-04-05 15:50:25,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2024-04-05 15:50:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:25,810 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:50:25,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.384615384615383) internal successors, (226), 13 states have internal predecessors, (226), 0 states have call successors, (0), 0 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 15:50:25,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:25,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:25,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:25,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:25,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:25,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:50:25,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-05 15:50:25,811 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:50:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 15:50:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 15:50:26,143 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 15:50:26,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:26,343 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:26,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1675942950, now seen corresponding path program 1 times [2024-04-05 15:50:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:26,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127497032] [2024-04-05 15:50:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:26,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 0 proven. 3840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:27,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:50:27,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127497032] [2024-04-05 15:50:27,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127497032] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:50:27,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504918743] [2024-04-05 15:50:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:27,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:27,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:50:27,781 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 15:50:27,805 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 15:50:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:28,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 34 conjunts are in the unsatisfiable core [2024-04-05 15:50:28,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:50:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 0 proven. 3840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:28,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 15:50:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3840 backedges. 0 proven. 3840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:29,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504918743] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 15:50:29,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 15:50:29,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43 [2024-04-05 15:50:29,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961915462] [2024-04-05 15:50:29,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 15:50:29,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-04-05 15:50:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:50:29,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-04-05 15:50:29,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2024-04-05 15:50:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:29,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:50:29,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 20.976744186046513) internal successors, (902), 43 states have internal predecessors, (902), 0 states have call successors, (0), 0 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 15:50:29,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:29,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:29,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:29,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:29,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:29,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:50:29,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-05 15:50:29,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 15:50:29,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:50:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 15:50:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 15:50:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-05 15:50:30,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-04-05 15:50:30,693 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,SelfDestructingSolverStorable8 [2024-04-05 15:50:30,694 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:30,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash -350829316, now seen corresponding path program 2 times [2024-04-05 15:50:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:30,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778328431] [2024-04-05 15:50:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:30,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6701 backedges. 6131 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:32,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:50:32,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778328431] [2024-04-05 15:50:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778328431] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:50:32,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465081055] [2024-04-05 15:50:32,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 15:50:32,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:32,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:50:32,723 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 15:50:32,757 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 15:50:33,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 15:50:33,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 15:50:33,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 1740 conjuncts, 42 conjunts are in the unsatisfiable core [2024-04-05 15:50:33,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:50:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6701 backedges. 6701 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 15:50:33,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 15:50:33,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465081055] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 15:50:33,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 15:50:33,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2024-04-05 15:50:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141740189] [2024-04-05 15:50:33,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 15:50:33,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-04-05 15:50:33,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:50:33,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-04-05 15:50:33,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2024-04-05 15:50:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:33,731 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:50:33,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 19.697674418604652) internal successors, (847), 43 states have internal predecessors, (847), 0 states have call successors, (0), 0 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 15:50:33,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:33,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:33,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:33,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:33,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:33,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:50:33,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-05 15:50:33,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 15:50:33,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-04-05 15:50:33,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:50:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 15:50:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 15:50:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-05 15:50:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-05 15:50:34,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-04-05 15:50:34,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:34,868 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:34,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:34,869 INFO L85 PathProgramCache]: Analyzing trace with hash -800486524, now seen corresponding path program 3 times [2024-04-05 15:50:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:34,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084753063] [2024-04-05 15:50:34,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:50:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 3823 proven. 119 refuted. 0 times theorem prover too weak. 2138 trivial. 0 not checked. [2024-04-05 15:50:46,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:50:46,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084753063] [2024-04-05 15:50:46,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084753063] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:50:46,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267445979] [2024-04-05 15:50:46,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-05 15:50:46,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:46,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:50:46,177 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 15:50:46,179 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 15:50:46,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-04-05 15:50:46,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 15:50:46,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 88 conjunts are in the unsatisfiable core [2024-04-05 15:50:46,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:50:49,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-05 15:50:49,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:50:49,292 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 15:50:49,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:50:49,474 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 27 treesize of output 11 [2024-04-05 15:50:49,523 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 23 treesize of output 11 [2024-04-05 15:50:49,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-04-05 15:50:49,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:50:49,726 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 15:50:49,889 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-04-05 15:50:49,889 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 1 case distinctions, treesize of input 35 treesize of output 29 [2024-04-05 15:50:49,916 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 23 treesize of output 11 [2024-04-05 15:50:49,939 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 15 treesize of output 7 [2024-04-05 15:50:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 1731 proven. 418 refuted. 0 times theorem prover too weak. 3931 trivial. 0 not checked. [2024-04-05 15:50:49,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 15:50:50,016 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 10 treesize of output 4 [2024-04-05 15:50:50,211 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-05 15:50:50,252 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))) is different from false [2024-04-05 15:50:50,279 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int)) (or (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))))) is different from false [2024-04-05 15:50:50,288 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse3)) 20))))) is different from false [2024-04-05 15:50:50,351 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|) (not (= 20 (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse3))))))) is different from false [2024-04-05 15:50:50,385 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_99| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_99|)) .cse1)) 20)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|)))) is different from false [2024-04-05 15:50:50,421 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_99| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_99|)) .cse3)) 20))))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131|)))) is different from false [2024-04-05 15:50:50,464 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_99| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|) (not (= 20 (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_99|)) .cse3)))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131|))))) is different from false [2024-04-05 15:50:50,629 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1911 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| Int) (v_ArrVal_1907 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_99| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1907) |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91| 1))) |c_~#stored_elements~0.base| v_ArrVal_1911) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_99|)) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_91|) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_131|))))) is different from false [2024-04-05 15:50:50,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 15:50:50,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 129 [2024-04-05 15:50:50,715 INFO L349 Elim1Store]: treesize reduction 31, result has 60.3 percent of original size [2024-04-05 15:50:50,715 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 232 treesize of output 220 [2024-04-05 15:50:50,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 15:50:50,738 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 152 treesize of output 144 [2024-04-05 15:50:50,744 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 59 treesize of output 47 [2024-04-05 15:50:50,780 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 8 treesize of output 4 [2024-04-05 15:50:50,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 15:50:50,798 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 47 treesize of output 47 [2024-04-05 15:50:50,815 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 3 [2024-04-05 15:50:50,822 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:50:50,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 81 [2024-04-05 15:50:50,828 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:50:50,829 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:50:50,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:50:50,831 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2024-04-05 15:50:50,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:50:50,837 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-04-05 15:50:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 1221 proven. 397 refuted. 0 times theorem prover too weak. 3931 trivial. 531 not checked. [2024-04-05 15:50:51,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267445979] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 15:50:51,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 15:50:51,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 20, 24] total 69 [2024-04-05 15:50:51,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820552794] [2024-04-05 15:50:51,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 15:50:51,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-04-05 15:50:51,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:50:51,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-04-05 15:50:51,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=3068, Unknown=9, NotChecked=1116, Total=4692 [2024-04-05 15:50:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:51,614 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:50:51,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 10.27536231884058) internal successors, (709), 69 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-05 15:50:51,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:51,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:51,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:51,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:51,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:51,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:50:51,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-05 15:50:51,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 15:50:51,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-04-05 15:50:51,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-04-05 15:50:51,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:50:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:50:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:50:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:50:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:50:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 15:50:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 15:50:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-05 15:50:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-05 15:50:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-04-05 15:50:53,833 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 15:50:54,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:50:54,031 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:50:54,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:50:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1972776899, now seen corresponding path program 4 times [2024-04-05 15:50:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:50:54,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113118789] [2024-04-05 15:50:54,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:50:54,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:50:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:51:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 3589 proven. 552 refuted. 0 times theorem prover too weak. 2229 trivial. 0 not checked. [2024-04-05 15:51:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:51:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113118789] [2024-04-05 15:51:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113118789] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:51:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264860472] [2024-04-05 15:51:02,147 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-04-05 15:51:02,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:51:02,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:51:02,148 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 15:51:02,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-04-05 15:51:10,249 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-04-05 15:51:10,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 15:51:10,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 98 conjunts are in the unsatisfiable core [2024-04-05 15:51:10,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:51:11,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-05 15:51:11,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:51:11,742 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 15:51:11,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:51:11,922 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 27 treesize of output 11 [2024-04-05 15:51:11,960 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 23 treesize of output 11 [2024-04-05 15:51:12,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-04-05 15:51:12,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:51:12,152 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 15:51:12,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:51:12,357 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 27 treesize of output 11 [2024-04-05 15:51:12,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 23 treesize of output 11 [2024-04-05 15:51:12,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-04-05 15:51:12,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:51:12,606 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 15:51:12,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:51:12,811 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 27 treesize of output 11 [2024-04-05 15:51:12,848 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 23 treesize of output 11 [2024-04-05 15:51:12,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-04-05 15:51:13,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:51:13,079 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 15:51:13,247 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 23 treesize of output 11 [2024-04-05 15:51:13,267 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 23 treesize of output 11 [2024-04-05 15:51:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 4189 proven. 402 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2024-04-05 15:51:13,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 15:51:13,586 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))) is different from false [2024-04-05 15:51:13,660 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2024-04-05 15:51:13,678 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 20))) is different from false [2024-04-05 15:51:13,697 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1)) 20))) is different from false [2024-04-05 15:51:13,706 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int)) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse3)) 20)))))) is different from false [2024-04-05 15:51:13,722 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse3)) 20))))) is different from false [2024-04-05 15:51:14,438 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2300 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1))))))) is different from false [2024-04-05 15:51:14,486 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2300 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1))))))) is different from false [2024-04-05 15:51:14,504 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2300 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1) 20)))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|)))) is different from false [2024-04-05 15:51:14,531 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2300 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse7 .cse1) 1)))))) (let ((.cse6 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse5 (+ 88 |c_~#queue~0.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse3) 20)) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|)))))) is different from false [2024-04-05 15:51:16,762 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (v_ArrVal_2300 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| Int) (v_ArrVal_2296 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2296) |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse7 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse1))) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1) 20))))))) is different from false [2024-04-05 15:51:16,830 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_187| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2296) |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_187|))) (store (store .cse7 .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1) 20)) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|)))))) is different from false [2024-04-05 15:51:16,858 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_187| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse9 (+ (select .cse8 .cse9) 1)))))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_2296) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_187|))) (store (store .cse7 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| 1)) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|) (not (= 20 (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1)))))))) (< (select .cse10 .cse9) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244|)))) is different from false [2024-04-05 15:51:16,905 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_183| Int) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_187| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_179| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse10 (store .cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse10 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse10 .cse3) 1)))))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2296) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse9 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_187|))) (store (store .cse9 .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_245| 1)) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_244|) (not (= 20 (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_236| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_183|))) (store (store .cse6 .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_240| 1)) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_179|)) .cse1))) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_240|))))))) is different from false [2024-04-05 15:51:17,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 15:51:17,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1286 treesize of output 886 [2024-04-05 15:51:17,679 INFO L349 Elim1Store]: treesize reduction 42, result has 58.0 percent of original size [2024-04-05 15:51:17,679 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1188 treesize of output 968 [2024-04-05 15:51:17,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 15:51:17,707 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 463 treesize of output 447 [2024-04-05 15:51:17,717 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 170 treesize of output 158 [2024-04-05 15:51:17,726 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 13 treesize of output 9 [2024-04-05 15:51:17,736 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 13 treesize of output 9 [2024-04-05 15:51:17,745 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 13 treesize of output 9 [2024-04-05 15:51:17,781 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 8 treesize of output 4 [2024-04-05 15:51:17,788 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:51:17,789 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:51:17,790 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:51:17,824 INFO L349 Elim1Store]: treesize reduction 70, result has 40.7 percent of original size [2024-04-05 15:51:17,825 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 4 case distinctions, treesize of input 64 treesize of output 66 [2024-04-05 15:51:17,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 15:51:17,864 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 217 treesize of output 193 [2024-04-05 15:51:17,953 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:51:17,954 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-04-05 15:51:17,960 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:51:17,962 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-04-05 15:51:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 3659 proven. 322 refuted. 208 times theorem prover too weak. 1779 trivial. 402 not checked. [2024-04-05 15:51:26,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264860472] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 15:51:26,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 15:51:26,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30, 40] total 100 [2024-04-05 15:51:26,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461214758] [2024-04-05 15:51:26,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 15:51:26,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2024-04-05 15:51:26,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 15:51:26,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2024-04-05 15:51:26,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1126, Invalid=6132, Unknown=108, NotChecked=2534, Total=9900 [2024-04-05 15:51:26,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:51:26,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 15:51:26,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 8.97) internal successors, (897), 100 states have internal predecessors, (897), 0 states have call successors, (0), 0 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 15:51:26,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:51:26,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:51:26,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:51:26,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:51:26,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:51:26,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:51:26,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-05 15:51:26,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 15:51:26,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-04-05 15:51:26,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-04-05 15:51:26,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-04-05 15:51:26,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:51:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 15:51:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:51:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 15:51:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 15:51:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 15:51:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 15:51:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 15:51:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 15:51:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-05 15:51:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-05 15:51:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-04-05 15:51:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-04-05 15:51:37,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-04-05 15:51:37,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-04-05 15:51:37,572 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-05 15:51:37,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 15:51:37,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1860575481, now seen corresponding path program 5 times [2024-04-05 15:51:37,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 15:51:37,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127614300] [2024-04-05 15:51:37,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 15:51:37,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 15:51:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 15:51:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6542 backedges. 4457 proven. 1052 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2024-04-05 15:51:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 15:51:55,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127614300] [2024-04-05 15:51:55,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127614300] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 15:51:55,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864744905] [2024-04-05 15:51:55,172 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-04-05 15:51:55,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 15:51:55,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 15:51:55,174 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 15:51:55,176 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 15:56:47,484 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-04-05 15:56:47,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 15:56:47,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 408 conjunts are in the unsatisfiable core [2024-04-05 15:56:47,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 15:56:47,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-04-05 15:56:47,709 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 15:56:47,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2024-04-05 15:56:48,042 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:56:48,051 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 15:56:48,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2024-04-05 15:56:48,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:56:48,115 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 54 treesize of output 38 [2024-04-05 15:56:48,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2024-04-05 15:56:48,570 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 15:56:48,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2024-04-05 15:56:48,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:56:48,956 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 15:56:48,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2024-04-05 15:56:49,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:56:49,022 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 54 treesize of output 38 [2024-04-05 15:56:49,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2024-04-05 15:56:49,434 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 15:56:49,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2024-04-05 15:56:49,849 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:56:49,859 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 15:56:49,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2024-04-05 15:56:49,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:56:49,919 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 54 treesize of output 38 [2024-04-05 15:56:50,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2024-04-05 15:56:50,380 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 15:56:50,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2024-04-05 15:56:51,003 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:56:51,015 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 15:56:51,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 85 [2024-04-05 15:56:51,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:56:51,107 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 79 treesize of output 57 [2024-04-05 15:56:51,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 63 [2024-04-05 15:56:51,739 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 15:56:51,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 75 [2024-04-05 15:56:52,660 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:56:52,671 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 15:56:52,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 104 [2024-04-05 15:56:52,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:56:52,809 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 104 treesize of output 76 [2024-04-05 15:56:53,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 82 [2024-04-05 15:56:53,687 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 15:56:53,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 94 [2024-04-05 15:56:54,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:56:54,930 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 15:56:54,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 123 [2024-04-05 15:56:55,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:56:55,146 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 129 treesize of output 95 [2024-04-05 15:56:56,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 101 [2024-04-05 15:56:56,589 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 15:56:56,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 113 [2024-04-05 15:56:58,028 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:56:58,039 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 15:56:58,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 196 treesize of output 150 [2024-04-05 15:56:58,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:56:58,321 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 180 treesize of output 122 [2024-04-05 15:56:59,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 128 [2024-04-05 15:57:00,116 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 15:57:00,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 140 [2024-04-05 15:57:01,037 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:57:01,048 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 15:57:01,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2024-04-05 15:57:01,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:01,110 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 54 treesize of output 38 [2024-04-05 15:57:01,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-04-05 15:57:01,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:01,531 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 13 [2024-04-05 15:57:02,115 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:57:02,126 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-04-05 15:57:02,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-04-05 15:57:02,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:02,163 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 29 treesize of output 13 [2024-04-05 15:57:02,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-04-05 15:57:02,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:02,670 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 13 [2024-04-05 15:57:03,234 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:57:03,240 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-04-05 15:57:03,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-04-05 15:57:03,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:03,280 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 29 treesize of output 13 [2024-04-05 15:57:03,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-04-05 15:57:03,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:03,817 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 13 [2024-04-05 15:57:04,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:57:04,353 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-04-05 15:57:04,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2024-04-05 15:57:04,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:04,396 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 29 treesize of output 13 [2024-04-05 15:57:04,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 3 [2024-04-05 15:57:04,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:04,882 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 13 [2024-04-05 15:57:05,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:57:05,472 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-05 15:57:05,472 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-04-05 15:57:05,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:05,516 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 29 treesize of output 13 [2024-04-05 15:57:05,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-04-05 15:57:05,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:05,998 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 13 [2024-04-05 15:57:06,635 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:57:06,641 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-05 15:57:06,641 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-04-05 15:57:06,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:06,675 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 29 treesize of output 13 [2024-04-05 15:57:07,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-04-05 15:57:07,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:07,176 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 13 [2024-04-05 15:57:07,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:57:07,810 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-05 15:57:07,811 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-04-05 15:57:07,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:07,849 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 29 treesize of output 13 [2024-04-05 15:57:08,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-04-05 15:57:08,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:08,326 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 13 [2024-04-05 15:57:08,982 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 15:57:08,991 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-05 15:57:08,991 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2024-04-05 15:57:09,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:09,026 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 29 treesize of output 13 [2024-04-05 15:57:09,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-04-05 15:57:09,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 15:57:09,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 13 [2024-04-05 15:57:09,899 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-04-05 15:57:09,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2024-04-05 15:57:09,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-04-05 15:57:09,909 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 19 treesize of output 7 [2024-04-05 15:57:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6542 backedges. 4074 proven. 2327 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-04-05 15:57:09,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2024-04-05 16:04:14,714 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 16:04:14,714 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 16:04:14,729 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-05 16:04:15,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-04-05 16:04:15,753 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 16:04:15,915 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-04-05 16:04:15,945 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-04-05 16:04:15,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-04-05 16:04:15,945 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 844 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2024-04-05 16:04:15,946 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-04-05 16:04:15,946 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-04-05 16:04:15,946 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-04-05 16:04:15,946 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-04-05 16:04:15,954 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1] [2024-04-05 16:04:15,959 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-05 16:04:15,959 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 16:04:15,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-04-05 16:04:15,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 04:04:15 BasicIcfg [2024-04-05 16:04:15,965 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 16:04:15,965 INFO L158 Benchmark]: Toolchain (without parser) took 842271.66ms. Allocated memory was 209.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 135.4MB in the beginning and 742.8MB in the end (delta: -607.4MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-04-05 16:04:15,965 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory is still 172.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 16:04:15,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.10ms. Allocated memory was 209.7MB in the beginning and 296.7MB in the end (delta: 87.0MB). Free memory was 135.1MB in the beginning and 235.7MB in the end (delta: -100.6MB). Peak memory consumption was 4.5MB. Max. memory is 8.0GB. [2024-04-05 16:04:15,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.37ms. Allocated memory is still 296.7MB. Free memory was 235.7MB in the beginning and 232.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-05 16:04:15,966 INFO L158 Benchmark]: Boogie Preprocessor took 25.92ms. Allocated memory is still 296.7MB. Free memory was 232.6MB in the beginning and 230.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 16:04:15,966 INFO L158 Benchmark]: RCFGBuilder took 578.81ms. Allocated memory is still 296.7MB. Free memory was 230.5MB in the beginning and 205.8MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2024-04-05 16:04:15,966 INFO L158 Benchmark]: TraceAbstraction took 841054.40ms. Allocated memory was 296.7MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 204.8MB in the beginning and 742.8MB in the end (delta: -538.0MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-04-05 16:04:15,983 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory is still 172.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 561.10ms. Allocated memory was 209.7MB in the beginning and 296.7MB in the end (delta: 87.0MB). Free memory was 135.1MB in the beginning and 235.7MB in the end (delta: -100.6MB). Peak memory consumption was 4.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.37ms. Allocated memory is still 296.7MB. Free memory was 235.7MB in the beginning and 232.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.92ms. Allocated memory is still 296.7MB. Free memory was 232.6MB in the beginning and 230.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 578.81ms. Allocated memory is still 296.7MB. Free memory was 230.5MB in the beginning and 205.8MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 841054.40ms. Allocated memory was 296.7MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 204.8MB in the beginning and 742.8MB in the end (delta: -538.0MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11671, independent: 10797, independent conditional: 10566, independent unconditional: 231, dependent: 874, dependent conditional: 794, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10819, independent: 10797, independent conditional: 10566, independent unconditional: 231, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10819, independent: 10797, independent conditional: 10566, independent unconditional: 231, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10819, independent: 10797, independent conditional: 10566, independent unconditional: 231, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10885, independent: 10797, independent conditional: 346, independent unconditional: 10451, dependent: 88, dependent conditional: 44, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10885, independent: 10797, independent conditional: 132, independent unconditional: 10665, dependent: 88, dependent conditional: 22, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10885, independent: 10797, independent conditional: 132, independent unconditional: 10665, dependent: 88, dependent conditional: 22, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 372, independent: 370, independent conditional: 0, independent unconditional: 370, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 372, independent: 370, independent conditional: 0, independent unconditional: 370, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 3, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10885, independent: 10427, independent conditional: 132, independent unconditional: 10295, dependent: 86, dependent conditional: 21, dependent unconditional: 65, unknown: 372, unknown conditional: 1, unknown unconditional: 371] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 370, Positive conditional cache size: 0, Positive unconditional cache size: 370, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 236, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10885, independent: 10797, independent conditional: 346, independent unconditional: 10451, dependent: 88, dependent conditional: 44, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10885, independent: 10797, independent conditional: 132, independent unconditional: 10665, dependent: 88, dependent conditional: 22, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10885, independent: 10797, independent conditional: 132, independent unconditional: 10665, dependent: 88, dependent conditional: 22, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 372, independent: 370, independent conditional: 0, independent unconditional: 370, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 372, independent: 370, independent conditional: 0, independent unconditional: 370, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 3, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10885, independent: 10427, independent conditional: 132, independent unconditional: 10295, dependent: 86, dependent conditional: 21, dependent unconditional: 65, unknown: 372, unknown conditional: 1, unknown unconditional: 371] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 370, Positive conditional cache size: 0, Positive unconditional cache size: 370, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 236 ], Independence queries for same thread: 852 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 844 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 844 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 844 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 844 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 840.8s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 16.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 326, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 9.6s SatisfiabilityAnalysisTime, 52.3s InterpolantComputationTime, 9909 NumberOfCodeBlocks, 8853 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 12969 ConstructedInterpolants, 188 QuantifiedInterpolants, 102472 SizeOfPredicates, 189 NumberOfNonLiveVariables, 7914 ConjunctsInSsa, 368 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 50305/71557 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown