/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.conditional-comm-158c277 [2024-11-14 01:13:12,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 01:13:12,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2024-11-14 01:13:12,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 01:13:12,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 01:13:12,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 01:13:12,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 01:13:12,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 01:13:12,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 01:13:12,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 01:13:12,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * Use SBE=true [2024-11-14 01:13:12,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 01:13:12,671 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 01:13:12,671 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 01:13:12,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-14 01:13:12,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2024-11-14 01:13:12,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 01:13:12,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 01:13:12,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 01:13:12,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 01:13:12,914 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 01:13:12,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2024-11-14 01:13:14,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 01:13:14,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 01:13:14,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i [2024-11-14 01:13:14,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/accb34b70/76a90ade48154cde945762881b69d62f/FLAGa5e07717c [2024-11-14 01:13:14,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/accb34b70/76a90ade48154cde945762881b69d62f [2024-11-14 01:13:14,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 01:13:14,438 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-14 01:13:14,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 01:13:14,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 01:13:14,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 01:13:14,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7946433d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:14, skipping insertion in model container [2024-11-14 01:13:14,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 01:13:14" (1/1) ... [2024-11-14 01:13:14,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 01:13:14,790 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-11-14 01:13:14,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-11-14 01:13:14,799 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-11-14 01:13:14,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 01:13:14,839 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 01:13:14,907 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-11-14 01:13:14,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-11-14 01:13:14,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-11-14 01:13:14,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 01:13:15,073 INFO L204 MainTranslator]: Completed translation [2024-11-14 01:13:15,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15 WrapperNode [2024-11-14 01:13:15,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 01:13:15,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 01:13:15,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 01:13:15,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 01:13:15,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (1/1) ... [2024-11-14 01:13:15,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (1/1) ... [2024-11-14 01:13:15,214 INFO L138 Inliner]: procedures = 277, calls = 859, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1041 [2024-11-14 01:13:15,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 01:13:15,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 01:13:15,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 01:13:15,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 01:13:15,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (1/1) ... [2024-11-14 01:13:15,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (1/1) ... [2024-11-14 01:13:15,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (1/1) ... [2024-11-14 01:13:15,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (1/1) ... [2024-11-14 01:13:15,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (1/1) ... [2024-11-14 01:13:15,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (1/1) ... [2024-11-14 01:13:15,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (1/1) ... [2024-11-14 01:13:15,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (1/1) ... [2024-11-14 01:13:15,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 01:13:15,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 01:13:15,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 01:13:15,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 01:13:15,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (1/1) ... [2024-11-14 01:13:15,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 01:13:15,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 01:13:15,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 01:13:15,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 01:13:15,396 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-14 01:13:15,397 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-14 01:13:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-14 01:13:15,397 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-14 01:13:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 01:13:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-14 01:13:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 01:13:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 01:13:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-14 01:13:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 01:13:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 01:13:15,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 01:13:15,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 01:13:15,398 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 01:13:15,518 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 01:13:15,519 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 01:13:16,569 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 01:13:16,569 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 01:13:16,613 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 01:13:16,613 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-14 01:13:16,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 01:13:16 BoogieIcfgContainer [2024-11-14 01:13:16,613 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 01:13:16,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 01:13:16,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 01:13:16,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 01:13:16,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 01:13:14" (1/3) ... [2024-11-14 01:13:16,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcb48a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 01:13:16, skipping insertion in model container [2024-11-14 01:13:16,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:13:15" (2/3) ... [2024-11-14 01:13:16,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcb48a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 01:13:16, skipping insertion in model container [2024-11-14 01:13:16,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 01:13:16" (3/3) ... [2024-11-14 01:13:16,620 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-11-14 01:13:16,629 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 01:13:16,630 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 1055 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2024-11-14 01:13:16,630 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 01:13:16,747 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-14 01:13:16,864 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:16,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-14 01:13:16,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 01:13:16,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-14 01:13:16,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-14 01:13:16,970 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 01:13:16,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-14 01:13:16,993 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@627043b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:16,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 01:13:17,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:17,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:17,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2092329073, now seen corresponding path program 1 times [2024-11-14 01:13:17,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:17,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462522727] [2024-11-14 01:13:17,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:17,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:17,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:17,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462522727] [2024-11-14 01:13:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462522727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:17,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:17,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 01:13:17,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025733694] [2024-11-14 01:13:17,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:17,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 01:13:17,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:17,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 01:13:17,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 01:13:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:17,965 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:17,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 449.0) internal successors, (898), 2 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:17,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:18,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:18,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 01:13:18,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:18,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:18,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1224127823, now seen corresponding path program 1 times [2024-11-14 01:13:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:18,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173233144] [2024-11-14 01:13:18,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:18,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:18,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173233144] [2024-11-14 01:13:18,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173233144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:18,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:18,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 01:13:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115783531] [2024-11-14 01:13:18,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:18,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 01:13:18,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:18,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 01:13:18,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 01:13:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:18,782 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:18,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:18,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:18,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:18,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:18,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 01:13:18,928 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:18,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:18,929 INFO L85 PathProgramCache]: Analyzing trace with hash 976138712, now seen corresponding path program 1 times [2024-11-14 01:13:18,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:18,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889909037] [2024-11-14 01:13:18,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:18,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:23,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889909037] [2024-11-14 01:13:23,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889909037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:23,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-14 01:13:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167587362] [2024-11-14 01:13:23,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:23,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 01:13:23,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:23,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 01:13:23,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-14 01:13:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:23,413 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:23,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 65.35714285714286) internal successors, (915), 14 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:23,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:23,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:23,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:25,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 01:13:25,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 01:13:25,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:25,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:25,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1289369389, now seen corresponding path program 1 times [2024-11-14 01:13:25,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:25,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303747228] [2024-11-14 01:13:25,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:25,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:30,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:30,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:30,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303747228] [2024-11-14 01:13:30,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303747228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:30,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:30,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-14 01:13:30,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404666564] [2024-11-14 01:13:30,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:30,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 01:13:30,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:30,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 01:13:30,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2024-11-14 01:13:30,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:30,572 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:30,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 38.291666666666664) internal successors, (919), 24 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:30,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:30,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:30,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-14 01:13:30,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:35,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:35,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:35,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 01:13:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:13:35,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 01:13:35,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:35,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:35,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1520373643, now seen corresponding path program 1 times [2024-11-14 01:13:35,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:35,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557924286] [2024-11-14 01:13:35,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:35,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:35,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:35,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557924286] [2024-11-14 01:13:35,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557924286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:35,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:35,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 01:13:35,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601610694] [2024-11-14 01:13:35,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:35,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 01:13:35,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:35,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 01:13:35,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 01:13:35,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:35,921 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:35,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 229.25) internal successors, (917), 4 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:35,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:35,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:35,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-14 01:13:35,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:13:35,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 01:13:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 01:13:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:36,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 01:13:36,167 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:36,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash -89146180, now seen corresponding path program 1 times [2024-11-14 01:13:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:36,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277646660] [2024-11-14 01:13:36,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:36,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:36,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:36,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277646660] [2024-11-14 01:13:36,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277646660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:36,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:36,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 01:13:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090757389] [2024-11-14 01:13:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:36,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 01:13:36,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:36,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 01:13:36,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 01:13:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:36,543 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:36,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:36,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:36,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:36,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-14 01:13:36,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-14 01:13:36,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:36,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:36,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 01:13:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 01:13:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:36,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 01:13:36,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:36,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash 835854914, now seen corresponding path program 1 times [2024-11-14 01:13:36,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:36,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739059008] [2024-11-14 01:13:36,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:36,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:37,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:37,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739059008] [2024-11-14 01:13:37,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739059008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:37,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:37,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 01:13:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390831522] [2024-11-14 01:13:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:37,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 01:13:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:37,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 01:13:37,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 01:13:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:37,313 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:37,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:37,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:37,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:37,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-14 01:13:37,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-14 01:13:37,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:37,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:37,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 01:13:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 01:13:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:37,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 01:13:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 01:13:37,398 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-14 01:13:37,399 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2024-11-14 01:13:37,406 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:37,407 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 01:13:37,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-14 01:13:37,407 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@627043b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:37,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-14 01:13:37,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-14 01:13:37,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:37,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2052049097, now seen corresponding path program 1 times [2024-11-14 01:13:37,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:37,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104813428] [2024-11-14 01:13:37,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:37,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:37,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:37,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104813428] [2024-11-14 01:13:37,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104813428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:37,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:37,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 01:13:37,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705121947] [2024-11-14 01:13:37,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:37,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 01:13:37,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:37,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 01:13:37,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 01:13:37,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:37,539 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:37,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 429.0) internal successors, (858), 2 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:37,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:37,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:37,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-14 01:13:37,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-11-14 01:13:37,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-14 01:13:37,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 01:13:37,608 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-14 01:13:37,608 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2024-11-14 01:13:37,616 INFO L123 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:37,617 INFO L185 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-14 01:13:37,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2024-11-14 01:13:37,618 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@627043b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 01:13:37,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 01:13:37,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:37,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:37,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1709362812, now seen corresponding path program 1 times [2024-11-14 01:13:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:37,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176759057] [2024-11-14 01:13:37,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:37,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:37,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:37,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176759057] [2024-11-14 01:13:37,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176759057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:37,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 01:13:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541727024] [2024-11-14 01:13:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:37,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 01:13:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:37,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 01:13:37,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 01:13:37,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:37,762 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:37,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 471.0) internal successors, (942), 2 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:37,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:37,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:37,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 01:13:37,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:37,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1555446182, now seen corresponding path program 1 times [2024-11-14 01:13:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:37,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672397441] [2024-11-14 01:13:37,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:38,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:38,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672397441] [2024-11-14 01:13:38,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672397441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:38,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:38,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 01:13:38,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571638373] [2024-11-14 01:13:38,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:38,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 01:13:38,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:38,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 01:13:38,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 01:13:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,008 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:38,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:38,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:38,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 01:13:38,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:38,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:38,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1189428659, now seen corresponding path program 1 times [2024-11-14 01:13:38,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:38,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788995021] [2024-11-14 01:13:38,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:38,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:38,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:38,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788995021] [2024-11-14 01:13:38,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788995021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:38,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 01:13:38,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768843373] [2024-11-14 01:13:38,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:38,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 01:13:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:38,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 01:13:38,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 01:13:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,402 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:38,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:38,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:38,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:38,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:38,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 01:13:38,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:38,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash 198698646, now seen corresponding path program 1 times [2024-11-14 01:13:38,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:38,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580234757] [2024-11-14 01:13:38,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:38,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580234757] [2024-11-14 01:13:38,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580234757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:38,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:38,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 01:13:38,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870710098] [2024-11-14 01:13:38,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:38,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 01:13:38,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:38,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 01:13:38,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 01:13:38,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,851 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:38,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:38,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:38,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:38,852 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:38,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 01:13:38,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:38,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash 650613492, now seen corresponding path program 1 times [2024-11-14 01:13:38,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:38,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991623649] [2024-11-14 01:13:38,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:38,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:41,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:41,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991623649] [2024-11-14 01:13:41,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991623649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:41,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:41,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-14 01:13:41,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357815428] [2024-11-14 01:13:41,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:41,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 01:13:41,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:41,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 01:13:41,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-14 01:13:41,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:41,286 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:41,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 66.53333333333333) internal successors, (998), 15 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:41,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:41,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:41,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:41,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:41,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:13:44,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 01:13:44,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:44,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:44,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1954997615, now seen corresponding path program 1 times [2024-11-14 01:13:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097571536] [2024-11-14 01:13:44,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:46,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:46,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097571536] [2024-11-14 01:13:46,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097571536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:46,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:46,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 01:13:46,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943922487] [2024-11-14 01:13:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:46,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 01:13:46,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:46,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 01:13:46,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-14 01:13:46,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:46,781 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:46,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 83.5) internal successors, (1002), 12 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:46,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:46,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:46,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:46,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:46,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:13:46,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:13:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:13:49,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 01:13:49,454 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:49,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1173242905, now seen corresponding path program 1 times [2024-11-14 01:13:49,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:49,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863804692] [2024-11-14 01:13:49,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:49,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:13:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:13:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:13:55,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863804692] [2024-11-14 01:13:55,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863804692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:13:55,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:13:55,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-11-14 01:13:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855383387] [2024-11-14 01:13:55,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:13:55,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 01:13:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:13:55,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 01:13:55,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-14 01:13:55,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:55,540 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:13:55,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 40.08) internal successors, (1002), 25 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:13:55,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:55,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:55,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:55,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:55,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:13:55,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:13:55,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:13:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:13:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:13:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:13:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:13:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:13:59,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 01:13:59,558 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:13:59,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:13:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1358330900, now seen corresponding path program 1 times [2024-11-14 01:13:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:13:59,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022283313] [2024-11-14 01:13:59,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:13:59,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:13:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:14:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:14:06,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:14:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022283313] [2024-11-14 01:14:06,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022283313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:14:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:14:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-11-14 01:14:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906762576] [2024-11-14 01:14:06,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:14:06,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 01:14:06,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:14:06,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 01:14:06,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-14 01:14:06,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:06,266 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:14:06,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 35.92857142857143) internal successors, (1006), 28 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:14:06,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:06,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:06,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:14:06,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:06,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:14:06,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:14:06,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:14:06,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:14:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:14:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:14:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:14:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-14 01:14:10,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 01:14:10,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:14:10,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:14:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash -385627273, now seen corresponding path program 1 times [2024-11-14 01:14:10,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:14:10,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462349787] [2024-11-14 01:14:10,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:14:10,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:14:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:14:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:14:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:14:27,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462349787] [2024-11-14 01:14:27,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462349787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 01:14:27,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 01:14:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2024-11-14 01:14:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688716888] [2024-11-14 01:14:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 01:14:27,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-14 01:14:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:14:27,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-14 01:14:27,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1787, Unknown=0, NotChecked=0, Total=1980 [2024-11-14 01:14:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:27,513 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:14:27,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 22.4) internal successors, (1008), 45 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:14:27,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:27,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:27,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:14:27,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:27,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:14:27,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:14:27,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:14:27,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-14 01:14:27,514 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:39,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:14:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:14:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:14:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:14:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-14 01:14:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-14 01:14:39,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 01:14:39,244 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:14:39,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:14:39,245 INFO L85 PathProgramCache]: Analyzing trace with hash 746259210, now seen corresponding path program 1 times [2024-11-14 01:14:39,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:14:39,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391280093] [2024-11-14 01:14:39,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:14:39,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:14:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:14:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:14:48,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:14:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391280093] [2024-11-14 01:14:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391280093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 01:14:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827515325] [2024-11-14 01:14:48,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:14:48,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 01:14:48,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 01:14:48,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 01:14:48,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 01:14:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:14:48,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 2367 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-14 01:14:48,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 01:14:49,793 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-11-14 01:14:49,846 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-11-14 01:14:50,102 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:14:50,110 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-14 01:14:50,111 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-11-14 01:14:50,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:50,144 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-11-14 01:14:50,262 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-11-14 01:14:50,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:50,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 01:14:50,584 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:14:50,591 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-14 01:14:50,592 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-11-14 01:14:50,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:50,641 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-11-14 01:14:50,771 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-11-14 01:14:50,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:50,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 01:14:51,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:14:51,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 29 treesize of output 13 [2024-11-14 01:14:51,031 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-11-14 01:14:51,176 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-11-14 01:14:51,187 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-11-14 01:14:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:14:51,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 01:14:51,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1343 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2024-11-14 01:14:51,852 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1343 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2024-11-14 01:14:51,857 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1343 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2024-11-14 01:14:51,863 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1343 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2024-11-14 01:14:51,887 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1343 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) |t1Thread1of1ForFork0_enqueue_~x#1|)) .cse1))))) is different from false [2024-11-14 01:14:51,906 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1343 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)) 400))) is different from false [2024-11-14 01:14:51,920 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1343 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|)))) is different from false [2024-11-14 01:14:51,940 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1343 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (or (not (= 400 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|)))) is different from false [2024-11-14 01:14:52,467 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1343 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1338) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))))))) is different from false [2024-11-14 01:14:52,709 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1335 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1335) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse4 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1338) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|))))) is different from false [2024-11-14 01:14:52,752 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_1338 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1335 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1335) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse4 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1338) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|))))) is different from false [2024-11-14 01:14:52,774 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_1338 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1335 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1335) .cse6 (+ (select .cse5 .cse6) 1)))))) (let ((.cse4 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1338) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|))))) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|)))) is different from false [2024-11-14 01:14:52,809 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_27| Int) (v_ArrVal_1338 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33| Int) (v_ArrVal_1343 (Array Int Int)) (v_ArrVal_1335 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1335) .cse6 (+ (select .cse7 .cse6) 1)))))) (let ((.cse0 (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1338) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) (not (= 400 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_27|))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1343) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_33|)))))) is different from false [2024-11-14 01:14:53,892 INFO L349 Elim1Store]: treesize reduction 306, result has 39.5 percent of original size [2024-11-14 01:14:53,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 745 treesize of output 506 [2024-11-14 01:14:53,931 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-14 01:14:53,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 400 treesize of output 376 [2024-11-14 01:14:54,016 INFO L349 Elim1Store]: treesize reduction 72, result has 52.3 percent of original size [2024-11-14 01:14:54,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 295 treesize of output 312 [2024-11-14 01:14:54,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:54,042 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 359 treesize of output 357 [2024-11-14 01:14:54,081 INFO L349 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2024-11-14 01:14:54,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 235 treesize of output 186 [2024-11-14 01:14:54,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:54,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 168 [2024-11-14 01:14:54,117 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 143 treesize of output 119 [2024-11-14 01:14:54,198 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 43 treesize of output 35 [2024-11-14 01:14:54,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-14 01:14:54,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:54,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 196 [2024-11-14 01:14:54,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:14:54,595 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 183 treesize of output 159 [2024-11-14 01:14:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-14 01:14:55,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827515325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 01:14:55,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 01:14:55,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 34] total 86 [2024-11-14 01:14:55,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249582419] [2024-11-14 01:14:55,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 01:14:55,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-11-14 01:14:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:14:55,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-11-14 01:14:55,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=590, Invalid=4690, Unknown=28, NotChecked=2002, Total=7310 [2024-11-14 01:14:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:55,415 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:14:55,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 36.348837209302324) internal successors, (3126), 86 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:14:55,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:14:55,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:55,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:14:55,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:14:55,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:14:55,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:14:55,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:14:55,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-14 01:14:55,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-11-14 01:14:55,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:15:09,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 01:15:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:15:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:15:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:15:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:15:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:15:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:15:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:15:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-14 01:15:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-14 01:15:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-14 01:15:10,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 01:15:10,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 01:15:10,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:15:10,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:15:10,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1808246139, now seen corresponding path program 1 times [2024-11-14 01:15:10,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:15:10,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111021609] [2024-11-14 01:15:10,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:15:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:15:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:15:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:15:25,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:15:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111021609] [2024-11-14 01:15:25,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111021609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 01:15:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342364070] [2024-11-14 01:15:25,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:15:25,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 01:15:25,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 01:15:25,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 01:15:25,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 01:15:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:15:25,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 2372 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-14 01:15:25,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 01:15:26,956 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 19 treesize of output 1 [2024-11-14 01:15:27,004 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-11-14 01:15:27,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:15:27,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-14 01:15:27,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:27,431 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:15:27,444 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-14 01:15:27,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-14 01:15:27,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:27,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:27,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-14 01:15:27,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:15:27,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-14 01:15:27,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:27,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 01:15:27,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:27,924 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2024-11-14 01:15:27,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 56 [2024-11-14 01:15:28,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:28,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:28,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-11-14 01:15:28,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:15:28,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 17 [2024-11-14 01:15:28,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:28,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 01:15:28,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:28,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 29 treesize of output 13 [2024-11-14 01:15:28,609 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-11-14 01:15:28,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:28,894 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2024-11-14 01:15:28,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 56 [2024-11-14 01:15:28,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:28,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:28,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-11-14 01:15:29,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:15:29,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 17 [2024-11-14 01:15:29,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:15:29,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 01:15:29,308 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-11-14 01:15:29,317 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-11-14 01:15:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:15:29,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 01:15:29,482 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1641 (Array Int Int))) (not (= 400 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))) is different from false [2024-11-14 01:15:48,686 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (v_ArrVal_1633 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1635 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| (* (select .cse0 .cse4) 4)))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (store .cse0 .cse1 v_ArrVal_1635) .cse2 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 v_ArrVal_1639)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) .cse1) 400)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1635) (= 400 (select (store (store (store .cse0 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse1 v_ArrVal_1635) .cse2 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4)))))) is different from false [2024-11-14 01:15:48,777 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (v_ArrVal_1633 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1632 Int) (v_ArrVal_1635 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1632)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ (* (select .cse1 .cse5) 4) |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 v_ArrVal_1635) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 v_ArrVal_1639)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) .cse2))) (= 400 (select (store (store (store .cse1 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 v_ArrVal_1635) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1635)))))) is different from false [2024-11-14 01:15:48,827 WARN L851 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1633 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1632 Int) (v_ArrVal_1635 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1632)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ (* (select .cse1 .cse5) 4) |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 v_ArrVal_1635) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 v_ArrVal_1639)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) .cse2))) (= 400 (select (store (store (store .cse1 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 v_ArrVal_1635) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1635))))))) is different from false [2024-11-14 01:15:49,031 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (= 400 (select .cse0 .cse1)) (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_42| Int) (v_ArrVal_1633 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1632 Int) (v_ArrVal_1635 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_1632)))) (let ((.cse2 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (+ (* (select .cse2 .cse6) 4) |c_~#queue~0.offset|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (= 400 (select (store (store (store .cse2 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 v_ArrVal_1635) .cse5 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse6)) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1635) (not (= (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse2 .cse4 v_ArrVal_1635) .cse5 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_42| 1)) .cse6 v_ArrVal_1639)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) .cse4) 400))))))))) is different from false [2024-11-14 01:15:49,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_42| Int) (v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1632 Int) (v_ArrVal_1635 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)))) (let ((.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 v_ArrVal_1632)))) (let ((.cse3 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ (* (select .cse3 .cse7) 4) |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (= (select .cse0 .cse1) 400) (not (= 400 (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store (store .cse3 .cse4 v_ArrVal_1635) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_42| 1)) .cse7 v_ArrVal_1639)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) .cse4))) (= 400 (select (store (store (store .cse3 .cse6 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 v_ArrVal_1635) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse7)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1635)))))))) is different from false [2024-11-14 01:15:49,390 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_42| Int) (v_ArrVal_1633 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_35| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1632 Int) (v_ArrVal_1635 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse6 (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse8 (+ (* (select .cse8 .cse7) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|)))) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse7 v_ArrVal_1632)))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1633) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ (* 4 (select .cse0 .cse4)) |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (= 400 (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 v_ArrVal_1635) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse4)) (not (= 400 (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 v_ArrVal_1635) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_35|) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_42| 1)) .cse4 v_ArrVal_1639)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) .cse2))) (= 400 (select .cse6 .cse7)) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1635)))))))) is different from false [2024-11-14 01:15:56,984 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1635 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1626 Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1626)))) (let ((.cse1 (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse5))))) (or (not (= 400 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store (store .cse1 .cse2 v_ArrVal_1635) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 v_ArrVal_1639)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) .cse2))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1635) (= 400 (select (store (store (store .cse1 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 v_ArrVal_1635) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse5))))))) is different from false [2024-11-14 01:15:57,084 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1639 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1635 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1626 Int) (v_ArrVal_1628 (Array Int Int)) (v_ArrVal_1625 Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1625) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1626)))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| (* (select .cse0 .cse4) 4))) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (= 400 (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 v_ArrVal_1635) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse4)) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1635) (not (= 400 (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 v_ArrVal_1635) .cse3 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 v_ArrVal_1639)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) .cse2)))))))) is different from false [2024-11-14 01:15:57,140 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1639 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1635 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1626 Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_1625 Int)) (let ((.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1625) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_1626)))) (let ((.cse0 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ 1600 |c_~#queue~0.offset|))) (or (= 400 (select (store (store (store .cse0 .cse1 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse2 v_ArrVal_1635) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_39|) .cse4)) (< (+ (select .cse0 .cse2) 1) v_ArrVal_1635) (not (= 400 (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store (store .cse0 .cse2 v_ArrVal_1635) .cse3 |v_t1Thread1of1ForFork0_enqueue_~x#1_39|) .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 v_ArrVal_1639)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) .cse2)))))))) is different from false [2024-11-14 01:15:57,165 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1639 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1635 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1626 Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_1625 Int)) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1625) .cse1 v_ArrVal_1626)))) (let ((.cse2 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (+ (* (select .cse2 .cse6) 4) |c_~#queue~0.offset|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ 1600 |c_~#queue~0.offset|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_1635) (= 400 (select (store (store (store .cse2 .cse4 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse3 v_ArrVal_1635) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_39|) .cse6)) (not (= 400 (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse2 .cse3 v_ArrVal_1635) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_39|) .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 v_ArrVal_1639)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) .cse3))))))))))) is different from false [2024-11-14 01:15:57,207 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_39| Int) (v_ArrVal_1639 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_1641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46| Int) (v_ArrVal_1635 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int) (v_ArrVal_1626 Int) (v_ArrVal_1628 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_~x#1| Int) (v_ArrVal_1625 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1625) .cse1 v_ArrVal_1626)))) (let ((.cse2 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_1628) |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (+ |c_~#queue~0.offset| (* (select .cse2 .cse6) 4))) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ 1600 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_46|) (= 400 (select (store (store (store .cse2 .cse3 (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) .cse4 v_ArrVal_1635) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_39|) .cse6)) (not (= 400 (select (select (store (store .cse7 |c_~#queue~0.base| (store (store (store (store .cse2 .cse4 v_ArrVal_1635) .cse5 |v_t1Thread1of1ForFork0_enqueue_~x#1_39|) .cse3 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 v_ArrVal_1639)) |c_~#stored_elements~0.base| v_ArrVal_1641) |c_~#queue~0.base|) .cse4))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1635))))))) is different from false [2024-11-14 01:16:03,154 INFO L349 Elim1Store]: treesize reduction 394, result has 39.2 percent of original size [2024-11-14 01:16:03,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 2028 treesize of output 1917 [2024-11-14 01:16:03,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:16:03,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 598 treesize of output 557 [2024-11-14 01:16:03,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-11-14 01:16:03,255 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 42 treesize of output 38 [2024-11-14 01:16:03,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 01:16:03,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:16:03,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 136 [2024-11-14 01:16:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 23 not checked. [2024-11-14 01:16:25,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342364070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 01:16:25,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 01:16:25,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 35, 42] total 114 [2024-11-14 01:16:25,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11856062] [2024-11-14 01:16:25,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 01:16:25,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 114 states [2024-11-14 01:16:25,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-14 01:16:25,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2024-11-14 01:16:25,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1046, Invalid=9206, Unknown=98, NotChecked=2532, Total=12882 [2024-11-14 01:16:25,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:16:25,074 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-14 01:16:25,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 114 states, 114 states have (on average 28.17543859649123) internal successors, (3212), 114 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 01:16:25,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:16:25,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:16:25,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:16:25,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:16:25,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:16:25,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:16:25,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:16:25,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-11-14 01:16:25,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-11-14 01:16:25,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-11-14 01:16:25,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:16:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 01:16:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:16:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 01:16:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 01:16:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 01:16:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 01:16:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 01:16:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-14 01:16:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-14 01:16:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-14 01:16:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-14 01:16:48,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 01:16:48,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 01:16:48,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 01:16:48,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 01:16:48,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1665651112, now seen corresponding path program 1 times [2024-11-14 01:16:48,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-14 01:16:48,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058174443] [2024-11-14 01:16:48,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:16:48,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 01:16:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:17:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:17:08,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-14 01:17:08,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058174443] [2024-11-14 01:17:08,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058174443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 01:17:08,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812285372] [2024-11-14 01:17:08,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 01:17:08,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 01:17:08,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-11-14 01:17:08,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 01:17:08,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 01:17:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 01:17:08,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 2375 conjuncts, 160 conjuncts are in the unsatisfiable core [2024-11-14 01:17:08,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 01:17:11,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 01:17:11,291 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 22 [2024-11-14 01:17:11,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:17:11,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-14 01:17:11,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:11,924 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:17:11,938 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2024-11-14 01:17:11,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2024-11-14 01:17:11,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:11,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:11,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-14 01:17:12,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:17:12,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-11-14 01:17:12,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:12,347 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 20 [2024-11-14 01:17:13,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:13,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:17:13,316 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-11-14 01:17:13,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2024-11-14 01:17:13,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:13,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:13,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:13,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:13,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-11-14 01:17:13,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:17:13,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 37 [2024-11-14 01:17:14,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:14,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:17:14,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 41 [2024-11-14 01:17:14,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:14,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:14,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:14,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:14,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2024-11-14 01:17:15,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:15,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:17:15,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 44 [2024-11-14 01:17:16,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:16,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:16,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:16,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 01:17:16,199 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-14 01:17:16,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 66 [2024-11-14 01:17:16,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:16,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:16,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:16,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:16,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2024-11-14 01:17:16,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:16,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:17:16,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2024-11-14 01:17:16,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:16,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:17:16,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2024-11-14 01:17:17,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:17,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2024-11-14 01:17:17,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:17:17,366 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 26 treesize of output 14 [2024-11-14 01:17:17,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 01:17:17,480 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-11-14 01:17:17,688 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-11-14 01:17:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 01:17:17,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 01:17:18,953 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse4 (select |c_#memory_int| |c_~#stored_elements~0.base|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)))) (and (forall ((v_ArrVal_1936 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse4 .cse5 v_ArrVal_1936)))) (or (not (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)))) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse3) 1)))))) (forall ((v_ArrVal_1936 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| (store .cse4 .cse5 v_ArrVal_1936)))) (or (= (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (select .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)))) 0) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store .cse7 |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse3) 0)))))))) is different from false [2024-11-14 01:17:26,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse2 (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 v_ArrVal_1935)))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1936))))) (or (= (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (select .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse3) 0)))))) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse11 (let ((.cse12 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 v_ArrVal_1935)))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1936))))) (or (not (= (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (select .cse10 (+ (* 4 (select .cse10 .cse1)) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store .cse11 |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse3) 1)))))))) is different from false [2024-11-14 01:17:47,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse9 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) (.cse5 (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse7 (+ (* (select .cse6 .cse9) 4) |c_~#queue~0.offset|)) (.cse8 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 v_ArrVal_1935)))) (let ((.cse0 (store (select .cse4 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1936))) (or (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse1) 0))) (= (let ((.cse2 (select (store .cse4 |c_~#stored_elements~0.base| .cse0) |c_~#queue~0.base|))) (select .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|))) 0))))) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse11 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse7 |t1Thread1of1ForFork0_enqueue_~x#1|) .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 v_ArrVal_1935)))) (let ((.cse12 (store (select .cse11 |c_~#stored_elements~0.base|) .cse5 v_ArrVal_1936))) (or (not (= (let ((.cse10 (select (store .cse11 |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base|))) (select .cse10 (+ (* 4 (select .cse10 .cse3)) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse12) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse1) 1)))))))))) is different from false [2024-11-14 01:22:51,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse26 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse27 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse26 .cse27 (+ (select .cse26 .cse27) 1)))))) (and (forall ((v_ArrVal_1922 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int)) (let ((.cse12 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1922))) (let ((.cse13 (let ((.cse15 (select .cse12 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse14 (select .cse13 .cse9))) (or (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_3 Int) (v_subst_2 Int)) (let ((.cse10 (store (store .cse13 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ .cse14 1)))) (let ((.cse6 (store (select (store .cse12 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_3)) .cse11 (+ v_subst_2 1)) .cse9 v_ArrVal_1935))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_1936))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse5) 1))))))))) (= 400 .cse14)))))) (forall ((v_ArrVal_1922 (Array Int Int)) (|t1Thread1of1ForFork0_~value~0#1| Int)) (let ((.cse22 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1922))) (let ((.cse23 (let ((.cse25 (select .cse22 |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse9) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse24 (select .cse23 .cse9))) (or (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_4 Int) (v_subst_1 Int)) (let ((.cse21 (store (store .cse23 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ .cse24 1)))) (let ((.cse19 (store (select (store .cse22 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse18 (store (store (let ((.cse20 (select (store (store .cse2 |c_~#queue~0.base| .cse21) |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (store (store .cse20 .cse1 (+ (select .cse20 .cse1) 1)) (+ (* (select .cse20 .cse9) 4) |c_~#queue~0.offset|) v_subst_4)) .cse11 (+ v_subst_1 1)) .cse9 v_ArrVal_1935))) (let ((.cse16 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_1936))) (or (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse17 (select (store (store .cse2 |c_~#queue~0.base| .cse18) |c_~#stored_elements~0.base| .cse16) |c_~#queue~0.base|))) (select .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse1) 4)))) 0))))))) (= 400 .cse24)))))))) is different from false [2024-11-14 01:22:52,464 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse18 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (+ |c_~#stored_elements~0.offset| 8)) (.cse2 (+ 1600 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse17 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse19 (+ (select .cse16 .cse18) 1))) (and (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int)) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 v_ArrVal_1918) .cse18 .cse19)))) (let ((.cse13 (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1922))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse0 (select .cse14 .cse10))) (or (= 400 .cse0) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_4 Int) (v_subst_1 Int)) (let ((.cse11 (store (store .cse14 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ .cse0 1)))) (let ((.cse7 (store (select (store .cse13 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse4 (store (store (let ((.cse9 (select (store (store .cse3 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse9 .cse2 (+ (select .cse9 .cse2) 1)) (+ |c_~#queue~0.offset| (* (select .cse9 .cse10) 4)) v_subst_4)) .cse12 (+ v_subst_1 1)) .cse10 v_ArrVal_1935))) (let ((.cse5 (store (select (store (store .cse3 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_1936))) (or (= (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| .cse4) |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base|))) (select .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)))) 0) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse3 |c_~#stored_elements~0.base| .cse5) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse6) 0))))))))))))))) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int)) (let ((.cse20 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 .cse17 v_ArrVal_1918) .cse18 .cse19)))) (let ((.cse27 (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_1922))) (let ((.cse28 (let ((.cse30 (select .cse27 |c_~#queue~0.base|))) (store .cse30 (+ (* (select .cse30 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse29 (select .cse28 .cse10))) (or (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_3 Int) (v_subst_2 Int)) (let ((.cse26 (store (store .cse28 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ .cse29 1)))) (let ((.cse24 (store (select (store .cse27 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse20 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse2 (+ (select .cse25 .cse2) 1)) (+ |c_~#queue~0.offset| (* (select .cse25 .cse10) 4)) v_subst_3)) .cse12 (+ v_subst_2 1)) .cse10 v_ArrVal_1935))) (let ((.cse21 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_1936))) (or (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse6) 1))) (not (= (let ((.cse22 (select (store (store .cse20 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse22 (+ (* 4 (select .cse22 .cse2)) |c_~#queue~0.offset|))) 0)))))))) (= 400 .cse29)))))))))) is different from false [2024-11-14 01:22:53,184 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse17 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse18 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse16 (store .cse19 .cse20 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse16 .cse17 v_ArrVal_1918) .cse18 (+ (select .cse16 .cse18) 1)))))) (let ((.cse13 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1922))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse0 (select .cse14 .cse10))) (or (= 400 .cse0) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_4 Int) (v_subst_1 Int)) (let ((.cse11 (store (store .cse14 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ .cse0 1)))) (let ((.cse7 (store (select (store .cse13 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse9 (select (store (store .cse1 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse9 .cse5 (+ (select .cse9 .cse5) 1)) (+ (* (select .cse9 .cse10) 4) |c_~#queue~0.offset|) v_subst_4)) .cse12 (+ v_subst_1 1)) .cse10 v_ArrVal_1935))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_1936))) (or (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse3) 0))) (= (let ((.cse4 (select (store (store .cse1 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (select .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|))) 0))))))))))))) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse22 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse32 (store .cse19 .cse20 |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse32 .cse17 v_ArrVal_1918) .cse18 (+ (select .cse32 .cse18) 1)))))) (let ((.cse28 (store .cse22 |c_~#stored_elements~0.base| v_ArrVal_1922))) (let ((.cse29 (let ((.cse31 (select .cse28 |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse30 (select .cse29 .cse10))) (or (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_3 Int) (v_subst_2 Int)) (let ((.cse27 (store (store .cse29 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ .cse30 1)))) (let ((.cse25 (store (select (store .cse28 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse26 (select (store (store .cse22 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (store (store .cse26 .cse5 (+ (select .cse26 .cse5) 1)) (+ (* (select .cse26 .cse10) 4) |c_~#queue~0.offset|) v_subst_3)) .cse12 (+ v_subst_2 1)) .cse10 v_ArrVal_1935))) (let ((.cse24 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_1936))) (or (not (= (let ((.cse21 (select (store (store .cse22 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse21 (+ (* 4 (select .cse21 .cse5)) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse3) 1))))))))) (= 400 .cse30))))))))) is different from false [2024-11-14 01:22:53,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse20 .cse19)) (.cse9 (+ |c_~#stored_elements~0.offset| 8)) (.cse3 (+ 1600 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 1608 |c_~#queue~0.offset|)) (.cse11 (+ |c_~#queue~0.offset| 1604)) (.cse18 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse17 (store .cse20 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse17 .cse18 v_ArrVal_1918) .cse19 (+ (select .cse17 .cse19) 1)))))) (let ((.cse14 (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_1922))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse11) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse1 (select .cse15 .cse11))) (or (= .cse1 400) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_4 Int) (v_subst_1 Int)) (let ((.cse12 (store (store .cse15 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse11 (+ .cse1 1)))) (let ((.cse8 (store (select (store .cse14 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse5 (store (store (let ((.cse10 (select (store (store .cse4 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base|))) (store (store .cse10 .cse3 (+ (select .cse10 .cse3) 1)) (+ (* (select .cse10 .cse11) 4) |c_~#queue~0.offset|) v_subst_4)) .cse13 (+ v_subst_1 1)) .cse11 v_ArrVal_1935))) (let ((.cse6 (store (select (store (store .cse4 |c_~#stored_elements~0.base| .cse8) |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1936))) (or (= (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| .cse5) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (select .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)))) 0) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= 0 (select (select (store (store .cse4 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse7)))))))))))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse23 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse32 (store .cse20 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse32 .cse18 v_ArrVal_1918) .cse19 (+ (select .cse32 .cse19) 1)))))) (let ((.cse29 (store .cse23 |c_~#stored_elements~0.base| v_ArrVal_1922))) (let ((.cse30 (let ((.cse31 (select .cse29 |c_~#queue~0.base|))) (store .cse31 (+ |c_~#queue~0.offset| (* (select .cse31 .cse11) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse21 (select .cse30 .cse11))) (or (= .cse21 400) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_3 Int) (v_subst_2 Int)) (let ((.cse28 (store (store .cse30 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse11 (+ .cse21 1)))) (let ((.cse26 (store (select (store .cse29 |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (store (store (let ((.cse27 (select (store (store .cse23 |c_~#queue~0.base| .cse28) |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base|))) (store (store .cse27 .cse3 (+ (select .cse27 .cse3) 1)) (+ (* (select .cse27 .cse11) 4) |c_~#queue~0.offset|) v_subst_3)) .cse13 (+ v_subst_2 1)) .cse11 v_ArrVal_1935))) (let ((.cse25 (store (select (store (store .cse23 |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) .cse9 v_ArrVal_1936))) (or (not (= (let ((.cse22 (select (store (store .cse23 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (select .cse22 (+ (* (select .cse22 .cse3) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse23 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse7) 1)))))))))))))))))))) is different from false [2024-11-14 01:22:54,013 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse19 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (select .cse20 .cse19)) (.cse8 (+ |c_~#stored_elements~0.offset| 8)) (.cse5 (+ 1600 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse10 (+ |c_~#queue~0.offset| 1604)) (.cse18 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse17 (store .cse20 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse17 .cse18 v_ArrVal_1918) .cse19 (+ (select .cse17 .cse19) 1)))))) (let ((.cse13 (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_1922))) (let ((.cse14 (let ((.cse16 (select .cse13 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse15 (select .cse14 .cse10))) (or (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_4 Int) (v_subst_1 Int)) (let ((.cse11 (store (store .cse14 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ .cse15 1)))) (let ((.cse7 (store (select (store .cse13 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse9 (select (store (store .cse1 |c_~#queue~0.base| .cse11) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (store (store .cse9 .cse5 (+ (select .cse9 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse9 .cse10) 4)) v_subst_4)) .cse12 (+ v_subst_1 1)) .cse10 v_ArrVal_1935))) (let ((.cse2 (store (select (store (store .cse1 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_1936))) (or (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse3) 0))) (= (let ((.cse4 (select (store (store .cse1 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|))) (select .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|))) 0))))))) (= 400 .cse15))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse22 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse32 (store .cse20 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse32 .cse18 v_ArrVal_1918) .cse19 (+ (select .cse32 .cse19) 1)))))) (let ((.cse28 (store .cse22 |c_~#stored_elements~0.base| v_ArrVal_1922))) (let ((.cse29 (let ((.cse31 (select .cse28 |c_~#queue~0.base|))) (store .cse31 (+ (* (select .cse31 .cse10) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse30 (select .cse29 .cse10))) (or (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_3 Int) (v_subst_2 Int)) (let ((.cse27 (store (store .cse29 .cse12 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse10 (+ .cse30 1)))) (let ((.cse25 (store (select (store .cse28 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse26 (select (store (store .cse22 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (store (store .cse26 .cse5 (+ (select .cse26 .cse5) 1)) (+ |c_~#queue~0.offset| (* (select .cse26 .cse10) 4)) v_subst_3)) .cse12 (+ v_subst_2 1)) .cse10 v_ArrVal_1935))) (let ((.cse24 (store (select (store (store .cse22 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse8 v_ArrVal_1936))) (or (not (= (let ((.cse21 (select (store (store .cse22 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (select .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse5) 4)))) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse22 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse3) 1))))))))) (= 400 .cse30)))))))))))) is different from false [2024-11-14 01:24:16,362 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_~#stored_elements~0.offset| 8)) (.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#stored_elements~0.offset| 4)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse9 (+ |c_~#queue~0.offset| 1604)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|)) (.cse18 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((v_ArrVal_1915 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse17 .cse18 v_ArrVal_1915)))) (let ((.cse16 (select .cse2 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse12 (let ((.cse14 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse15 (store .cse16 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse15 .cse11 v_ArrVal_1918) .cse9 (+ (select .cse15 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1922) |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse13 (select .cse12 .cse9))) (or (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_3 Int) (v_subst_2 Int)) (let ((.cse10 (store (store .cse12 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ .cse13 1)))) (let ((.cse6 (store (select (store (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1922) |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse3 (store (store (let ((.cse8 (select (store (store .cse2 |c_~#queue~0.base| .cse10) |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base|))) (store (store .cse8 .cse1 (+ (select .cse8 .cse1) 1)) (+ (* (select .cse8 .cse9) 4) |c_~#queue~0.offset|) v_subst_3)) .cse11 (+ v_subst_2 1)) .cse9 v_ArrVal_1935))) (let ((.cse4 (store (select (store (store .cse2 |c_~#stored_elements~0.base| .cse6) |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_1936))) (or (not (= (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| .cse3) |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base|))) (select .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|))) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse2 |c_~#stored_elements~0.base| .cse4) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse5) 1))))))))) (= 400 .cse13))))) (< (select .cse16 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|))))) (forall ((v_ArrVal_1915 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse17 .cse18 v_ArrVal_1915)))) (let ((.cse19 (select .cse20 |c_~#queue~0.base|))) (or (< (select .cse19 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse27 (let ((.cse29 (select (store (store .cse20 |c_~#queue~0.base| (let ((.cse30 (store .cse19 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse30 .cse11 v_ArrVal_1918) .cse9 (+ (select .cse30 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1922) |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse9) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse28 (select .cse27 .cse9))) (or (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_4 Int) (v_subst_1 Int)) (let ((.cse26 (store (store .cse27 .cse11 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse9 (+ .cse28 1)))) (let ((.cse24 (store (select (store (store .cse20 |c_~#stored_elements~0.base| v_ArrVal_1922) |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse23 (store (store (let ((.cse25 (select (store (store .cse20 |c_~#queue~0.base| .cse26) |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|))) (store (store .cse25 .cse1 (+ (select .cse25 .cse1) 1)) (+ (* (select .cse25 .cse9) 4) |c_~#queue~0.offset|) v_subst_4)) .cse11 (+ v_subst_1 1)) .cse9 v_ArrVal_1935))) (let ((.cse21 (store (select (store (store .cse20 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base|) .cse7 v_ArrVal_1936))) (or (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse20 |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse5) 0))) (= (let ((.cse22 (select (store (store .cse20 |c_~#queue~0.base| .cse23) |c_~#stored_elements~0.base| .cse21) |c_~#queue~0.base|))) (select .cse22 (+ (* (select .cse22 .cse1) 4) |c_~#queue~0.offset|))) 0))))))) (= 400 .cse28))))))))))) is different from false [2024-11-14 01:24:18,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#stored_elements~0.offset| 8)) (.cse4 (+ 1600 |c_~#queue~0.offset|)) (.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse13 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse17 (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ |c_ULTIMATE.start_init_~q#1.offset| 1604) 0)) (.cse18 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((v_ArrVal_1915 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse17 .cse18 v_ArrVal_1915)))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse14 (let ((.cse15 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse16 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse16 .cse13 v_ArrVal_1918) .cse1 (+ (select .cse16 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1922) |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse1) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse2 (select .cse14 .cse1))) (or (= 400 .cse2) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_4 Int) (v_subst_1 Int)) (let ((.cse12 (store (store .cse14 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse2 1)))) (let ((.cse9 (store (select (store (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_1922) |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse6 (store (store (let ((.cse11 (select (store (store .cse5 |c_~#queue~0.base| .cse12) |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (store (store .cse11 .cse4 (+ (select .cse11 .cse4) 1)) (+ (* 4 (select .cse11 .cse1)) |c_~#queue~0.offset|) v_subst_4)) .cse13 (+ v_subst_1 1)) .cse1 v_ArrVal_1935))) (let ((.cse7 (store (select (store (store .cse5 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1936))) (or (= (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| .cse6) |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base|))) (select .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|))) 0) (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse5 |c_~#stored_elements~0.base| .cse7) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse8) 0))))))))))))))))) (forall ((v_ArrVal_1915 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store .cse17 .cse18 v_ArrVal_1915)))) (let ((.cse19 (select .cse21 |c_~#queue~0.base|))) (or (< (select .cse19 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1918 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|t1Thread1of1ForFork0_enqueue_~x#1| Int)) (let ((.cse28 (let ((.cse29 (select (store (store .cse21 |c_~#queue~0.base| (let ((.cse30 (store .cse19 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_enqueue_~x#1|))) (store (store .cse30 .cse13 v_ArrVal_1918) .cse1 (+ (select .cse30 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1922) |c_~#queue~0.base|))) (store .cse29 (+ |c_~#queue~0.offset| (* (select .cse29 .cse1) 4)) |t1Thread1of1ForFork0_~value~0#1|)))) (let ((.cse20 (select .cse28 .cse1))) (or (= 400 .cse20) (forall ((v_ArrVal_1936 Int) (v_ArrVal_1935 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_subst_3 Int) (v_subst_2 Int)) (let ((.cse27 (store (store .cse28 .cse13 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse1 (+ .cse20 1)))) (let ((.cse25 (store (select (store (store .cse21 |c_~#stored_elements~0.base| v_ArrVal_1922) |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))) (let ((.cse24 (store (store (let ((.cse26 (select (store (store .cse21 |c_~#queue~0.base| .cse27) |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (store (store .cse26 .cse4 (+ (select .cse26 .cse4) 1)) (+ (* 4 (select .cse26 .cse1)) |c_~#queue~0.offset|) v_subst_3)) .cse13 (+ v_subst_2 1)) .cse1 v_ArrVal_1935))) (let ((.cse22 (store (select (store (store .cse21 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base|) .cse10 v_ArrVal_1936))) (or (forall ((v_ArrVal_1939 (Array Int Int))) (not (= (select (select (store (store .cse21 |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base| v_ArrVal_1939) |c_~#stored_elements~0.base|) .cse8) 1))) (not (= (let ((.cse23 (select (store (store .cse21 |c_~#queue~0.base| .cse24) |c_~#stored_elements~0.base| .cse22) |c_~#queue~0.base|))) (select .cse23 (+ (* (select .cse23 .cse4) 4) |c_~#queue~0.offset|))) 0)))))))))))))))))) is different from false [2024-11-14 01:24:21,185 INFO L349 Elim1Store]: treesize reduction 454, result has 37.2 percent of original size [2024-11-14 01:24:21,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 16769 treesize of output 3261 [2024-11-14 01:24:21,635 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-14 01:24:21,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 4398 treesize of output 4114 [2024-11-14 01:24:21,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:24:21,676 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 5022 treesize of output 5018 [2024-11-14 01:24:22,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 01:24:22,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 435182497 treesize of output 407707635 Received shutdown request... [2024-11-14 01:27:25,387 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 01:27:25,393 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-14 01:27:25,393 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-11-14 01:27:25,393 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-11-14 01:27:25,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 01:27:25,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 01:27:25,587 WARN L596 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 1093 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-31-4-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-4-4-3-3-3-3-4-4-3-3-3-3-4-4-4-4-3-3-3-3-3-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-78-5-3-5-3-5-3-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-4-4-4-4-4-4-4-4-4-4-4-3-3-3-3-3-3-2-2-2-2-1 context. [2024-11-14 01:27:25,588 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 01:27:25,589 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/3) [2024-11-14 01:27:25,590 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 01:27:25,590 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 01:27:25,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-11-14 01:27:25,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 01:27:25 BasicIcfg [2024-11-14 01:27:25,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 01:27:25,613 INFO L158 Benchmark]: Toolchain (without parser) took 851174.43ms. Allocated memory was 83.9MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 55.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2024-11-14 01:27:25,613 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 37.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-14 01:27:25,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.64ms. Allocated memory is still 83.9MB. Free memory was 54.8MB in the beginning and 50.2MB in the end (delta: 4.6MB). Peak memory consumption was 44.8MB. Max. memory is 8.0GB. [2024-11-14 01:27:25,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.00ms. Allocated memory is still 83.9MB. Free memory was 50.2MB in the beginning and 41.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-11-14 01:27:25,613 INFO L158 Benchmark]: Boogie Preprocessor took 120.06ms. Allocated memory is still 83.9MB. Free memory was 41.0MB in the beginning and 34.9MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2024-11-14 01:27:25,613 INFO L158 Benchmark]: RCFGBuilder took 1277.02ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 34.9MB in the beginning and 52.6MB in the end (delta: -17.7MB). Peak memory consumption was 40.3MB. Max. memory is 8.0GB. [2024-11-14 01:27:25,613 INFO L158 Benchmark]: TraceAbstraction took 848996.97ms. Allocated memory was 104.9MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 52.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2024-11-14 01:27:25,614 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.15ms. Allocated memory is still 83.9MB. Free memory is still 37.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 635.64ms. Allocated memory is still 83.9MB. Free memory was 54.8MB in the beginning and 50.2MB in the end (delta: 4.6MB). Peak memory consumption was 44.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 139.00ms. Allocated memory is still 83.9MB. Free memory was 50.2MB in the beginning and 41.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 120.06ms. Allocated memory is still 83.9MB. Free memory was 41.0MB in the beginning and 34.9MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1277.02ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 34.9MB in the beginning and 52.6MB in the end (delta: -17.7MB). Peak memory consumption was 40.3MB. Max. memory is 8.0GB. * TraceAbstraction took 848996.97ms. Allocated memory was 104.9MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 52.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14647, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 181, dependent conditional: 150, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14502, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14502, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 54, dependent conditional: 23, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11761, independent: 11728, independent conditional: 0, independent unconditional: 11728, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11761, independent: 11724, independent conditional: 0, independent unconditional: 11724, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 407, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 370, dependent conditional: 20, dependent unconditional: 350, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 14520, independent: 2738, independent conditional: 0, independent unconditional: 2738, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 11761, unknown conditional: 2, unknown unconditional: 11759] , Statistics on independence cache: Total cache size (in pairs): 11761, Positive cache size: 11728, Positive conditional cache size: 0, Positive unconditional cache size: 11728, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1890, Maximal queried relation: 4, Independence queries for same thread: 145, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 1445, Number of trivial persistent sets: 1190, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12625, independent: 12594, independent conditional: 0, independent unconditional: 12594, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14647, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 181, dependent conditional: 150, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14502, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14502, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 1872, independent unconditional: 12594, dependent: 54, dependent conditional: 23, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14520, independent: 14466, independent conditional: 0, independent unconditional: 14466, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11761, independent: 11728, independent conditional: 0, independent unconditional: 11728, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11761, independent: 11724, independent conditional: 0, independent unconditional: 11724, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 407, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 370, dependent conditional: 20, dependent unconditional: 350, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 14520, independent: 2738, independent conditional: 0, independent unconditional: 2738, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 11761, unknown conditional: 2, unknown unconditional: 11759] , Statistics on independence cache: Total cache size (in pairs): 11761, Positive cache size: 11728, Positive conditional cache size: 0, Positive unconditional cache size: 11728, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1890, Maximal queried relation: 4, Independence queries for same thread: 145 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6585, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 6570, independent: 6094, independent conditional: 0, independent unconditional: 6094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 462, unknown conditional: 0, unknown unconditional: 462] , Statistics on independence cache: Total cache size (in pairs): 12221, Positive cache size: 12189, Positive conditional cache size: 0, Positive unconditional cache size: 12189, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 372, Maximal queried relation: 0, Independence queries for same thread: 15, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 1281, Number of trivial persistent sets: 1275, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6198, independent: 6183, independent conditional: 0, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6585, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 30, dependent conditional: 15, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 372, independent unconditional: 6183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6570, independent: 6555, independent conditional: 0, independent unconditional: 6555, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 462, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 6570, independent: 6094, independent conditional: 0, independent unconditional: 6094, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 462, unknown conditional: 0, unknown unconditional: 462] , Statistics on independence cache: Total cache size (in pairs): 12221, Positive cache size: 12189, Positive conditional cache size: 0, Positive unconditional cache size: 12189, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 372, Maximal queried relation: 0, Independence queries for same thread: 15 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18363, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 679, dependent conditional: 635, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2465, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2465, independent: 2440, independent conditional: 0, independent unconditional: 2440, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 188, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 17728, independent: 15241, independent conditional: 0, independent unconditional: 15241, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2465, unknown conditional: 0, unknown unconditional: 2465] , Statistics on independence cache: Total cache size (in pairs): 14686, Positive cache size: 14632, Positive conditional cache size: 0, Positive unconditional cache size: 14632, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5499, Maximal queried relation: 0, Independence queries for same thread: 635, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 1248, Number of trivial persistent sets: 1168, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12229, independent: 12185, independent conditional: 0, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18363, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 679, dependent conditional: 635, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 5499, independent unconditional: 12185, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17728, independent: 17684, independent conditional: 0, independent unconditional: 17684, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2465, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2465, independent: 2440, independent conditional: 0, independent unconditional: 2440, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 188, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Protected Queries: 0 ], Cache Queries: [ total: 17728, independent: 15241, independent conditional: 0, independent unconditional: 15241, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 2465, unknown conditional: 0, unknown unconditional: 2465] , Statistics on independence cache: Total cache size (in pairs): 14686, Positive cache size: 14632, Positive conditional cache size: 0, Positive unconditional cache size: 14632, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5499, Maximal queried relation: 0, Independence queries for same thread: 635 - PositiveResult [Line: 1032]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 1093 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-31-4-3-3-2-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-3-4-4-3-3-3-3-4-4-3-3-3-3-4-4-4-4-3-3-3-3-3-3-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-78-5-3-5-3-5-3-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-4-4-4-4-4-4-4-4-4-4-4-3-3-3-3-3-3-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 1228 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 8.5s, 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: 55, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 6453 NumberOfCodeBlocks, 6453 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 6446 ConstructedInterpolants, 0 QuantifiedInterpolants, 13531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 1228 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, 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: 2, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 858 NumberOfCodeBlocks, 858 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 857 ConstructedInterpolants, 0 QuantifiedInterpolants, 857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 1228 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 828.0s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 64.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 253, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 124.9s InterpolantComputationTime, 13209 NumberOfCodeBlocks, 13209 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 15370 ConstructedInterpolants, 408 QuantifiedInterpolants, 145809 SizeOfPredicates, 97 NumberOfNonLiveVariables, 4739 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 147/408 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, ConComCheckerStatistics: CheckTime: 0.0s, ConditionCalculationTime: 0.0s, CommutingCounterexamples: 0, ConditionCalculations: 0, TraceChecks: 0, UnknownTraceChecks: 0, ImperfectProofs: 0, QuantifiedConditions: 0, FalseConditions: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown