/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 RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -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 18:45:32,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 18:45:33,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 18:45:33,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 18:45:33,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 18:45:33,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 18:45:33,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 18:45:33,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 18:45:33,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 18:45:33,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 18:45:33,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 18:45:33,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 18:45:33,041 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 18:45:33,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 18:45:33,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 18:45:33,042 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 18:45:33,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 18:45:33,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 18:45:33,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 18:45:33,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 18:45:33,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 18:45:33,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 18:45:33,044 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 18:45:33,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 18:45:33,044 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 18:45:33,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 18:45:33,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 18:45:33,044 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 18:45:33,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 18:45:33,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 18:45:33,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 18:45:33,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 18:45:33,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 18:45:33,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 18:45:33,046 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 18:45:33,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 18:45:33,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 18:45:33,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 18:45:33,047 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 18:45:33,047 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 -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 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 -> 10 [2024-04-05 18:45:33,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 18:45:33,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 18:45:33,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 18:45:33,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 18:45:33,278 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 18:45:33,279 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 18:45:34,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 18:45:34,577 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 18:45:34,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2024-04-05 18:45:34,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/388e422f4/37ce4ecc58f54a9097c3282483eb8147/FLAGd84dbfccd [2024-04-05 18:45:34,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/388e422f4/37ce4ecc58f54a9097c3282483eb8147 [2024-04-05 18:45:34,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 18:45:34,616 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 18:45:34,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 18:45:34,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 18:45:34,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 18:45:34,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:45:34" (1/1) ... [2024-04-05 18:45:34,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3d34a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:34, skipping insertion in model container [2024-04-05 18:45:34,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:45:34" (1/1) ... [2024-04-05 18:45:34,669 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 18:45:35,029 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 18:45:35,037 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 18:45:35,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 18:45:35,056 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 18:45:35,100 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 18:45:35,102 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 18:45:35,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 18:45:35,148 INFO L206 MainTranslator]: Completed translation [2024-04-05 18:45:35,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35 WrapperNode [2024-04-05 18:45:35,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 18:45:35,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 18:45:35,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 18:45:35,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 18:45:35,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (1/1) ... [2024-04-05 18:45:35,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (1/1) ... [2024-04-05 18:45:35,190 INFO L138 Inliner]: procedures = 275, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2024-04-05 18:45:35,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 18:45:35,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 18:45:35,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 18:45:35,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 18:45:35,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (1/1) ... [2024-04-05 18:45:35,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (1/1) ... [2024-04-05 18:45:35,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (1/1) ... [2024-04-05 18:45:35,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (1/1) ... [2024-04-05 18:45:35,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (1/1) ... [2024-04-05 18:45:35,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (1/1) ... [2024-04-05 18:45:35,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (1/1) ... [2024-04-05 18:45:35,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (1/1) ... [2024-04-05 18:45:35,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 18:45:35,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 18:45:35,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 18:45:35,217 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 18:45:35,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (1/1) ... [2024-04-05 18:45:35,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 18:45:35,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:45:35,245 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 18:45:35,278 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 18:45:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-04-05 18:45:35,296 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-04-05 18:45:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-04-05 18:45:35,296 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-04-05 18:45:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 18:45:35,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 18:45:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-04-05 18:45:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-04-05 18:45:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 18:45:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-04-05 18:45:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 18:45:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 18:45:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 18:45:35,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 18:45:35,298 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 18:45:35,401 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 18:45:35,402 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 18:45:35,618 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 18:45:35,637 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 18:45:35,637 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-04-05 18:45:35,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:45:35 BoogieIcfgContainer [2024-04-05 18:45:35,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 18:45:35,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 18:45:35,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 18:45:35,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 18:45:35,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:45:34" (1/3) ... [2024-04-05 18:45:35,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4411e261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:45:35, skipping insertion in model container [2024-04-05 18:45:35,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:45:35" (2/3) ... [2024-04-05 18:45:35,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4411e261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:45:35, skipping insertion in model container [2024-04-05 18:45:35,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:45:35" (3/3) ... [2024-04-05 18:45:35,645 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2024-04-05 18:45:35,651 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 18:45:35,660 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 18:45:35,660 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-04-05 18:45:35,660 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 18:45:35,731 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-04-05 18:45:35,771 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 18:45:35,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 18:45:35,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:45:35,780 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 18:45:35,781 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 18:45:35,834 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 18:45:35,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:35,845 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 18:45:35,854 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;@55b1ee3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 18:45:35,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-05 18:45:35,900 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 18:45:35,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1100909939, now seen corresponding path program 1 times [2024-04-05 18:45:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:45:35,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108671340] [2024-04-05 18:45:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:45:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:36,234 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 18:45:36,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:45:36,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108671340] [2024-04-05 18:45:36,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108671340] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:45:36,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:45:36,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-05 18:45:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905439344] [2024-04-05 18:45:36,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:45:36,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-04-05 18:45:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:45:36,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-04-05 18:45:36,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-04-05 18:45:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:36,259 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:45:36,260 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 18:45:36,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:36,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 18:45:36,351 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 18:45:36,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:36,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1323198379, now seen corresponding path program 1 times [2024-04-05 18:45:36,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:45:36,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958707090] [2024-04-05 18:45:36,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:36,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:45:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:36,706 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 18:45:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:45:36,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958707090] [2024-04-05 18:45:36,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958707090] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:45:36,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:45:36,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 18:45:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646507012] [2024-04-05 18:45:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:45:36,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 18:45:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:45:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 18:45:36,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 18:45:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:36,713 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:45:36,714 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 18:45:36,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:36,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:36,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:36,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:36,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-04-05 18:45:36,841 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 18:45:36,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2002901627, now seen corresponding path program 1 times [2024-04-05 18:45:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:45:36,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931894414] [2024-04-05 18:45:36,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:45:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:36,943 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 18:45:36,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:45:36,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931894414] [2024-04-05 18:45:36,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931894414] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:45:36,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 18:45:36,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 18:45:36,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773036280] [2024-04-05 18:45:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:45:36,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 18:45:36,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:45:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 18:45:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 18:45:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:36,951 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:45:36,952 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 18:45:36,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:36,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:36,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:36,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-04-05 18:45:36,995 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 18:45:36,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1898140429, now seen corresponding path program 1 times [2024-04-05 18:45:36,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:45:36,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059062210] [2024-04-05 18:45:36,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:45:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:37,265 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 18:45:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:45:37,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059062210] [2024-04-05 18:45:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059062210] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:45:37,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909991535] [2024-04-05 18:45:37,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:37,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:45:37,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:45:37,294 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 18:45:37,336 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 18:45:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:37,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 4 conjunts are in the unsatisfiable core [2024-04-05 18:45:37,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:45:37,569 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 18:45:37,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 18:45:37,646 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 18:45:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909991535] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 18:45:37,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 18:45:37,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-04-05 18:45:37,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708896271] [2024-04-05 18:45:37,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 18:45:37,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-04-05 18:45:37,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:45:37,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-04-05 18:45:37,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-04-05 18:45:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:37,653 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:45:37,654 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 18:45:37,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:37,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:37,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:37,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:37,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:37,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:37,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:37,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:37,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-05 18:45:37,939 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 18:45:37,939 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 18:45:37,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash 44387869, now seen corresponding path program 2 times [2024-04-05 18:45:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:45:37,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367225196] [2024-04-05 18:45:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:45:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:38,206 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 18:45:38,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:45:38,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367225196] [2024-04-05 18:45:38,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367225196] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:45:38,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581889184] [2024-04-05 18:45:38,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 18:45:38,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:45:38,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:45:38,222 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 18:45:38,252 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 18:45:38,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-04-05 18:45:38,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 18:45:38,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2024-04-05 18:45:38,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:45:38,426 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 18:45:38,426 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 18:45:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581889184] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:45:38,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 18:45:38,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-04-05 18:45:38,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669219337] [2024-04-05 18:45:38,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:45:38,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-05 18:45:38,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:45:38,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-05 18:45:38,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-04-05 18:45:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:38,432 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:45:38,432 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 18:45:38,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:38,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:38,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:38,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:38,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:45:38,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-04-05 18:45:38,684 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 18:45:38,685 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 18:45:38,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash 26985882, now seen corresponding path program 1 times [2024-04-05 18:45:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:45:38,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696560257] [2024-04-05 18:45:38,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:38,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:45:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:38,897 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 18:45:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:45:38,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696560257] [2024-04-05 18:45:38,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696560257] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:45:38,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467495353] [2024-04-05 18:45:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:38,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:45:38,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:45:38,914 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 18:45:38,928 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 18:45:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:39,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 8 conjunts are in the unsatisfiable core [2024-04-05 18:45:39,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:45:39,195 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 18:45:39,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 18:45:39,356 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 18:45:39,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467495353] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 18:45:39,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 18:45:39,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-04-05 18:45:39,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42876532] [2024-04-05 18:45:39,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 18:45:39,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-04-05 18:45:39,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:45:39,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-04-05 18:45:39,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-04-05 18:45:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:39,359 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:45:39,359 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 18:45:39,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:39,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:39,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:39,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:39,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:45:39,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:45:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:45:39,558 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 18:45:39,757 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 18:45:39,757 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 18:45:39,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:39,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1417540742, now seen corresponding path program 2 times [2024-04-05 18:45:39,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:45:39,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622032140] [2024-04-05 18:45:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:39,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:45:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:40,224 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 18:45:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:45:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622032140] [2024-04-05 18:45:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622032140] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:45:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207882754] [2024-04-05 18:45:40,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 18:45:40,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:45:40,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:45:40,226 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 18:45:40,244 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 18:45:40,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 18:45:40,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 18:45:40,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 16 conjunts are in the unsatisfiable core [2024-04-05 18:45:40,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:45:40,703 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 18:45:40,703 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 18:45:41,103 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 18:45:41,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207882754] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 18:45:41,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 18:45:41,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-04-05 18:45:41,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86918082] [2024-04-05 18:45:41,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 18:45:41,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-04-05 18:45:41,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:45:41,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-04-05 18:45:41,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-04-05 18:45:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:41,106 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:45:41,106 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 18:45:41,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:41,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:41,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:41,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:41,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:45:41,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:45:41,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:45:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:45:41,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 18:45:41,611 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 18:45:41,811 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 18:45:41,811 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 18:45:41,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:41,812 INFO L85 PathProgramCache]: Analyzing trace with hash -124479686, now seen corresponding path program 3 times [2024-04-05 18:45:41,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:45:41,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510247533] [2024-04-05 18:45:41,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:41,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:45:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:43,186 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 18:45:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:45:43,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510247533] [2024-04-05 18:45:43,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510247533] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:45:43,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644575712] [2024-04-05 18:45:43,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-05 18:45:43,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:45:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:45:43,188 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 18:45:43,220 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 18:45:43,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-04-05 18:45:43,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 18:45:43,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 73 conjunts are in the unsatisfiable core [2024-04-05 18:45:43,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:45:45,368 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 18:45:45,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:45:45,432 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 18:45:45,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:45:45,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-04-05 18:45:45,707 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 18:45:45,776 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 18:45:45,777 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 18:45:45,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644575712] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:45:45,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 18:45:45,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [33] total 44 [2024-04-05 18:45:45,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505116277] [2024-04-05 18:45:45,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:45:45,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-04-05 18:45:45,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:45:45,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-04-05 18:45:45,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2024-04-05 18:45:45,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:45,779 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:45:45,779 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 18:45:45,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:45,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:45,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:45,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:45,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:45:45,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:45:45,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-05 18:45:45,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:45:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:45:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 18:45:46,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:45:46,111 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 18:45:46,310 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 18:45:46,311 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 18:45:46,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:46,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1675942950, now seen corresponding path program 1 times [2024-04-05 18:45:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:45:46,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323605681] [2024-04-05 18:45:46,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:46,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:45:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:47,591 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 18:45:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:45:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323605681] [2024-04-05 18:45:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323605681] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:45:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644132864] [2024-04-05 18:45:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:47,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:45:47,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:45:47,597 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 18:45:47,621 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 18:45:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:47,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 34 conjunts are in the unsatisfiable core [2024-04-05 18:45:47,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:45:48,395 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 18:45:48,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 18:45:49,256 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 18:45:49,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644132864] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 18:45:49,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 18:45:49,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43 [2024-04-05 18:45:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660363456] [2024-04-05 18:45:49,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 18:45:49,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-04-05 18:45:49,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:45:49,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-04-05 18:45:49,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2024-04-05 18:45:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:49,266 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:45:49,266 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 18:45:49,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:49,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:49,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:49,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:49,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:45:49,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:45:49,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-05 18:45:49,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:45:49,267 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:45:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:45:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 18:45:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:45:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-05 18:45:50,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-04-05 18:45:50,400 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 18:45:50,400 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 18:45:50,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash -350829316, now seen corresponding path program 2 times [2024-04-05 18:45:50,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:45:50,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891180488] [2024-04-05 18:45:50,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:45:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:45:52,583 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 18:45:52,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:45:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891180488] [2024-04-05 18:45:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891180488] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:45:52,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175953546] [2024-04-05 18:45:52,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 18:45:52,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:45:52,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:45:52,585 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 18:45:52,587 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 18:45:52,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 18:45:52,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 18:45:53,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 1740 conjuncts, 42 conjunts are in the unsatisfiable core [2024-04-05 18:45:53,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:45:53,561 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 18:45:53,561 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 18:45:53,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175953546] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 18:45:53,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 18:45:53,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2024-04-05 18:45:53,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043311655] [2024-04-05 18:45:53,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 18:45:53,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-04-05 18:45:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:45:53,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-04-05 18:45:53,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2024-04-05 18:45:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:53,564 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:45:53,564 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 18:45:53,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:53,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:53,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:53,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:53,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:45:53,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:45:53,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-05 18:45:53,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:45:53,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-04-05 18:45:53,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:45:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:45:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:45:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:45:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:45:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 18:45:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:45:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-05 18:45:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-05 18:45:54,430 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 18:45:54,627 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 18:45:54,628 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 18:45:54,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:45:54,628 INFO L85 PathProgramCache]: Analyzing trace with hash -800486524, now seen corresponding path program 3 times [2024-04-05 18:45:54,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:45:54,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450503672] [2024-04-05 18:45:54,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:45:54,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:45:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:46:05,454 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 18:46:05,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:46:05,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450503672] [2024-04-05 18:46:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450503672] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:46:05,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491820703] [2024-04-05 18:46:05,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-05 18:46:05,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:46:05,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:46:05,469 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 18:46:05,496 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 18:46:06,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-04-05 18:46:06,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 18:46:06,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 88 conjunts are in the unsatisfiable core [2024-04-05 18:46:06,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:46:08,406 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 18:46:08,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:46:08,469 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 18:46:08,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:46:08,655 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 18:46:08,691 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 18:46:08,815 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 18:46:08,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:46:08,877 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 18:46:09,036 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2024-04-05 18:46:09,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2024-04-05 18:46:09,075 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 18:46:09,101 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 18:46:09,128 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 18:46:09,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 18:46:09,178 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 18:46:09,393 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 18:46:09,445 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 18:46:09,456 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 18:46:09,465 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 18:46:09,524 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 18:46:09,555 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 18:46:09,570 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 18:46:09,596 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 18:46:10,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 18:46:10,349 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 18:46:10,377 INFO L349 Elim1Store]: treesize reduction 31, result has 60.3 percent of original size [2024-04-05 18:46:10,377 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 18:46:10,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 18:46:10,399 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 18:46:10,405 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 18:46:10,430 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 18:46:10,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 18:46:10,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2024-04-05 18:46:10,459 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 18:46:10,465 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:46:10,467 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 18:46:10,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:46:10,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:46:10,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:46:10,475 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 18:46:10,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:46:10,487 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-04-05 18:46:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 1333 proven. 397 refuted. 0 times theorem prover too weak. 3931 trivial. 419 not checked. [2024-04-05 18:46:11,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491820703] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 18:46:11,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 18:46:11,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 20, 24] total 69 [2024-04-05 18:46:11,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652007257] [2024-04-05 18:46:11,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 18:46:11,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-04-05 18:46:11,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:46:11,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-04-05 18:46:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=3167, Unknown=11, NotChecked=1000, Total=4692 [2024-04-05 18:46:11,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:46:11,186 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:46:11,187 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 18:46:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:46:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:46:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:46:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:46:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:46:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:46:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-05 18:46:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:46:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-04-05 18:46:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-04-05 18:46:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:46:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:46:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:46:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:46:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:46:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:46:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:46:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 18:46:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:46:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-05 18:46:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-05 18:46:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-04-05 18:46:13,137 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 18:46:13,333 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 18:46:13,334 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 18:46:13,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:46:13,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1972776899, now seen corresponding path program 4 times [2024-04-05 18:46:13,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:46:13,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887343849] [2024-04-05 18:46:13,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:46:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:46:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:46:21,274 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 18:46:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:46:21,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887343849] [2024-04-05 18:46:21,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887343849] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:46:21,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084859743] [2024-04-05 18:46:21,275 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-04-05 18:46:21,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:46:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:46:21,276 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 18:46:21,278 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 18:46:28,524 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-04-05 18:46:28,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 18:46:28,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 98 conjunts are in the unsatisfiable core [2024-04-05 18:46:28,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:46:29,934 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 18:46:30,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:46:30,001 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 18:46:30,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:46:30,167 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 18:46:30,200 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 18:46:30,316 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 18:46:30,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:46:30,376 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 18:46:30,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:46:30,575 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 18:46:30,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 23 treesize of output 11 [2024-04-05 18:46:30,769 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 18:46:30,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:46:30,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 16 treesize of output 11 [2024-04-05 18:46:31,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:46:31,091 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 18:46:31,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 23 treesize of output 11 [2024-04-05 18:46:31,215 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 18:46:31,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:46:31,264 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 18:46:31,379 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 18:46:31,397 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 18:46:31,464 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 18:46:31,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 18:46:31,670 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 |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2304) |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 18:46:31,741 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~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2304) |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 18:46:31,745 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 18:46:31,761 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 18:46:31,775 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 18:46:31,784 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 18:46:31,798 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 18:46:32,351 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 18:46:32,387 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 18:46:32,405 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 18:46:32,436 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 18:46:32,883 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_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| (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))))) (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|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse7 .cse6 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 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)))))))) is different from false [2024-04-05 18:46:33,280 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 18:46:33,339 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 18:46:33,363 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 18:46:33,406 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 18:46:34,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 18:46:34,228 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 18:46:34,269 INFO L349 Elim1Store]: treesize reduction 42, result has 58.0 percent of original size [2024-04-05 18:46:34,270 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 18:46:34,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 18:46:34,302 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 18:46:34,312 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 18:46:34,322 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 18:46:34,332 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 18:46:34,341 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 18:46:34,379 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 18:46:34,385 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:46:34,387 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:46:34,387 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:46:34,420 INFO L349 Elim1Store]: treesize reduction 70, result has 40.7 percent of original size [2024-04-05 18:46:34,420 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 18:46:34,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-05 18:46:34,459 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 18:46:34,543 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:46:34,544 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-04-05 18:46:34,549 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:46:34,551 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-04-05 18:46:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 3777 proven. 303 refuted. 8 times theorem prover too weak. 1779 trivial. 503 not checked. [2024-04-05 18:46:37,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084859743] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 18:46:37,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 18:46:37,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30, 40] total 100 [2024-04-05 18:46:37,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447875557] [2024-04-05 18:46:37,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 18:46:37,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2024-04-05 18:46:37,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 18:46:37,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2024-04-05 18:46:37,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1087, Invalid=5868, Unknown=81, NotChecked=2864, Total=9900 [2024-04-05 18:46:37,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:46:37,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 18:46:37,065 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 18:46:37,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:46:37,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:46:37,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:46:37,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:46:37,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:46:37,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:46:37,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-05 18:46:37,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:46:37,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-04-05 18:46:37,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-04-05 18:46:37,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-04-05 18:46:37,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:46:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 18:46:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:46:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 18:46:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 18:46:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-05 18:46:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 18:46:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 18:46:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-04-05 18:46:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-05 18:46:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-04-05 18:46:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-04-05 18:46:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-04-05 18:46:47,665 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 18:46:47,846 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 18:46:47,847 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 18:46:47,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 18:46:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1860575481, now seen corresponding path program 5 times [2024-04-05 18:46:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 18:46:47,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854387029] [2024-04-05 18:46:47,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 18:46:47,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 18:46:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 18:47:05,124 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 18:47:05,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 18:47:05,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854387029] [2024-04-05 18:47:05,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854387029] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 18:47:05,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645339835] [2024-04-05 18:47:05,125 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-04-05 18:47:05,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:47:05,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 18:47:05,126 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 18:47:05,128 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 18:51:31,839 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-04-05 18:51:31,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 18:51:31,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 408 conjunts are in the unsatisfiable core [2024-04-05 18:51:31,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 18:51:32,024 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 18:51:32,059 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 18:51:32,059 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 18:51:32,342 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:32,352 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 18:51:32,352 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 18:51:32,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:32,409 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 18:51:32,643 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 18:51:32,776 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 18:51:32,777 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 18:51:33,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:33,174 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 18:51:33,174 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 18:51:33,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:33,230 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 18:51:33,487 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 18:51:33,612 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 18:51:33,613 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 18:51:34,025 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:34,038 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 18:51:34,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 70 treesize of output 66 [2024-04-05 18:51:34,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:34,097 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 18:51:34,390 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 18:51:34,531 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 18:51:34,532 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 18:51:35,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:35,112 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 18:51:35,112 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 18:51:35,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:35,217 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 18:51:35,655 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 18:51:35,853 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 18:51:35,853 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 18:51:36,725 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:36,734 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 18:51:36,734 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 18:51:36,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:36,867 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 18:51:37,470 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 18:51:37,821 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 18:51:37,822 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 18:51:38,982 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:38,991 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 18:51:38,992 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 18:51:39,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:39,208 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 18:51:40,024 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 18:51:40,507 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 18:51:40,507 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 18:51:41,930 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:41,938 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 18:51:41,939 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 18:51:42,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:42,283 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 18:51:43,447 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 18:51:44,007 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2024-04-05 18:51:44,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 140 [2024-04-05 18:51:44,737 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:44,745 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-04-05 18:51:44,745 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 18:51:44,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:44,843 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 18:51:45,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-04-05 18:51:45,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:45,154 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 18:51:45,627 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:45,637 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-04-05 18:51:45,637 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 18:51:45,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:45,682 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 18:51:46,149 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 18:51:46,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:46,297 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 18:51:46,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:46,928 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-04-05 18:51:46,928 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 18:51:46,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:46,966 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 18:51:47,361 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 18:51:47,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:47,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 33 treesize of output 13 [2024-04-05 18:51:47,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:47,999 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-04-05 18:51:47,999 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 18:51:48,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:48,060 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 18:51:48,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 3 [2024-04-05 18:51:48,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:48,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 33 treesize of output 13 [2024-04-05 18:51:49,223 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:49,230 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-05 18:51:49,230 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 18:51:49,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:49,299 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 18:51:49,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-04-05 18:51:49,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:49,846 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 18:51:50,592 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:50,599 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-05 18:51:50,600 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 18:51:50,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:50,644 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 18:51:51,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-04-05 18:51:51,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:51,226 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 18:51:51,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:51,994 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-05 18:51:51,994 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 18:51:52,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:52,034 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 18:51:52,371 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 18:51:52,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:52,527 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 18:51:53,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-05 18:51:53,216 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-04-05 18:51:53,216 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 18:51:53,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:53,297 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 18:51:53,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-04-05 18:51:53,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-05 18:51:53,988 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 18:51:54,465 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-04-05 18:51:54,465 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 18:51:54,472 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 18:51:54,476 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 18:51:54,567 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 18:51:54,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 18:56:44,464 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_~i~0#1_130| Int)) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_231| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post38#1_307| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| Int) (|v_t1Thread1of1ForFork1_~i~0#1_129| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_235| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| Int) (|v_t1Thread1of1ForFork1_~value~0#1_87| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork1_~value~0#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_234| Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse3 (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_235| 1))))) (let ((.cse1 (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_130| 4) |c_~#stored_elements~0.offset|) |t1Thread1of1ForFork1_~value~0#1|))) (let ((.cse7 (select (store .cse8 |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_234|))) (or (< |v_t1Thread1of1ForFork1_~i~0#1_129| (+ |v_t1Thread1of1ForFork1_~i~0#1_130| 1)) (< (select (select (let ((.cse0 (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post38#1_307| 1)) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_231| 1)))) (store (store |c_#memory_int| |c_~#queue~0.base| .cse0) |c_~#stored_elements~0.base| (store (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse1) |c_~#queue~0.base| .cse0) |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork1_~i~0#1_129| 4) |c_~#stored_elements~0.offset|) |v_t1Thread1of1ForFork1_~value~0#1_87|))) |c_~#queue~0.base|) .cse4) 20) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_235|) (< (select .cse6 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_305|) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_231|) (< (select .cse7 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_301|))))))))) (< |v_t1Thread1of1ForFork1_~i~0#1_130| (+ |c_t1Thread1of1ForFork1_#t~post50#1| 1)))) is different from false Received shutdown request... [2024-04-05 18:59:41,076 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 18:59:41,076 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 18:59:41,076 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 18:59:41,629 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-04-05 18:59:41,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-04-05 18:59:41,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 18:59:41,830 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 844 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 238 known predicates. [2024-04-05 18:59:41,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-04-05 18:59:41,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-04-05 18:59:41,832 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-04-05 18:59:41,832 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-04-05 18:59:41,835 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1] [2024-04-05 18:59:41,838 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-05 18:59:41,838 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 18:59:41,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:59:41 BasicIcfg [2024-04-05 18:59:41,840 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 18:59:41,840 INFO L158 Benchmark]: Toolchain (without parser) took 847223.66ms. Allocated memory was 265.3MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 190.6MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2024-04-05 18:59:41,840 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 265.3MB. Free memory is still 234.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 18:59:41,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.16ms. Allocated memory is still 265.3MB. Free memory was 190.6MB in the beginning and 159.7MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2024-04-05 18:59:41,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.82ms. Allocated memory is still 265.3MB. Free memory was 159.7MB in the beginning and 157.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-04-05 18:59:41,840 INFO L158 Benchmark]: Boogie Preprocessor took 25.04ms. Allocated memory is still 265.3MB. Free memory was 157.0MB in the beginning and 154.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 18:59:41,840 INFO L158 Benchmark]: RCFGBuilder took 421.63ms. Allocated memory is still 265.3MB. Free memory was 154.9MB in the beginning and 131.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2024-04-05 18:59:41,841 INFO L158 Benchmark]: TraceAbstraction took 846199.42ms. Allocated memory was 265.3MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 130.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-04-05 18:59:41,841 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 265.3MB. Free memory is still 234.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 532.16ms. Allocated memory is still 265.3MB. Free memory was 190.6MB in the beginning and 159.7MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.82ms. Allocated memory is still 265.3MB. Free memory was 159.7MB in the beginning and 157.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.04ms. Allocated memory is still 265.3MB. Free memory was 157.0MB in the beginning and 154.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 421.63ms. Allocated memory is still 265.3MB. Free memory was 154.9MB in the beginning and 131.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 846199.42ms. Allocated memory was 265.3MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 130.3MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11670, independent: 10796, independent conditional: 10565, 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: 10818, independent: 10796, independent conditional: 10565, 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: 10818, independent: 10796, independent conditional: 10565, 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: 10818, independent: 10796, independent conditional: 10565, 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: 10884, independent: 10796, independent conditional: 346, independent unconditional: 10450, 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: 10884, independent: 10796, independent conditional: 132, independent unconditional: 10664, 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: 10884, independent: 10796, independent conditional: 132, independent unconditional: 10664, 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: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 3, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10884, independent: 10426, independent conditional: 132, independent unconditional: 10294, 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: 10884, independent: 10796, independent conditional: 346, independent unconditional: 10450, 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: 10884, independent: 10796, independent conditional: 132, independent unconditional: 10664, 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: 10884, independent: 10796, independent conditional: 132, independent unconditional: 10664, 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: 32, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 32, dependent conditional: 3, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10884, independent: 10426, independent conditional: 132, independent unconditional: 10294, 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 238 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 238 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 238 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 238 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 846.0s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 15.7s, 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, 8.7s SatisfiabilityAnalysisTime, 43.6s InterpolantComputationTime, 9909 NumberOfCodeBlocks, 8853 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 12969 ConstructedInterpolants, 188 QuantifiedInterpolants, 102472 SizeOfPredicates, 189 NumberOfNonLiveVariables, 7914 ConjunctsInSsa, 368 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 50535/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