/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 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 14:11:24,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 14:11:24,072 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 14:11:24,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 14:11:24,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 14:11:24,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 14:11:24,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 14:11:24,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 14:11:24,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 14:11:24,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 14:11:24,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 14:11:24,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 14:11:24,094 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 14:11:24,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 14:11:24,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 14:11:24,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:11:24,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:11:24,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 14:11:24,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 14:11:24,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 14:11:24,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 14:11:24,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 14:11:24,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 14:11:24,324 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 14:11:24,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas.i [2025-04-14 14:11:25,629 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cbf55a5/293dbb5c4fbc4fb9afa17af946b93b96/FLAGa53ce895c [2025-04-14 14:11:25,889 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 14:11:25,890 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas.i [2025-04-14 14:11:25,897 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cbf55a5/293dbb5c4fbc4fb9afa17af946b93b96/FLAGa53ce895c [2025-04-14 14:11:26,631 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cbf55a5/293dbb5c4fbc4fb9afa17af946b93b96 [2025-04-14 14:11:26,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 14:11:26,634 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 14:11:26,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 14:11:26,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 14:11:26,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 14:11:26,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:26,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345034dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26, skipping insertion in model container [2025-04-14 14:11:26,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:26,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 14:11:26,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas.i[31294,31307] [2025-04-14 14:11:26,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 14:11:26,912 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 14:11:26,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas.i[31294,31307] [2025-04-14 14:11:26,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 14:11:26,994 INFO L204 MainTranslator]: Completed translation [2025-04-14 14:11:26,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26 WrapperNode [2025-04-14 14:11:26,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 14:11:26,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 14:11:26,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 14:11:26,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 14:11:27,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:27,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:27,040 INFO L138 Inliner]: procedures = 179, calls = 46, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 243 [2025-04-14 14:11:27,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 14:11:27,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 14:11:27,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 14:11:27,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 14:11:27,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:27,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:27,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:27,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:27,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:27,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:27,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:27,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:27,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 14:11:27,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 14:11:27,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 14:11:27,076 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 14:11:27,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (1/1) ... [2025-04-14 14:11:27,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 14:11:27,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:11:27,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 14:11:27,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 14:11:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 14:11:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-14 14:11:27,130 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-14 14:11:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 14:11:27,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 14:11:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 14:11:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 14:11:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 14:11:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 14:11:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 14:11:27,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 14:11:27,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 14:11:27,132 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 14:11:27,236 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 14:11:27,237 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 14:11:27,540 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 14:11:27,540 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 14:11:27,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 14:11:27,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 14:11:27,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 02:11:27 BoogieIcfgContainer [2025-04-14 14:11:27,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 14:11:27,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 14:11:27,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 14:11:27,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 14:11:27,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:11:26" (1/3) ... [2025-04-14 14:11:27,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1220a156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:11:27, skipping insertion in model container [2025-04-14 14:11:27,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:11:26" (2/3) ... [2025-04-14 14:11:27,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1220a156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:11:27, skipping insertion in model container [2025-04-14 14:11:27,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 02:11:27" (3/3) ... [2025-04-14 14:11:27,838 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas.i [2025-04-14 14:11:27,848 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 14:11:27,850 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas.i that has 2 procedures, 29 locations, 34 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 14:11:27,850 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 14:11:27,903 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 14:11:27,931 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:11:27,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 14:11:27,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:11:27,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 14:11:27,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 14:11:28,000 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 14:11:28,012 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2025-04-14 14:11:28,018 INFO L340 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;@3531a6b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:11:28,018 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 14:11:28,337 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:28,338 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:28,338 INFO L139 ounterexampleChecker]: Examining path program with hash -1887886054, occurence #1 [2025-04-14 14:11:28,338 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:28,338 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:28,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:28,341 INFO L85 PathProgramCache]: Analyzing trace with hash -104275631, now seen corresponding path program 1 times [2025-04-14 14:11:28,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:28,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785294413] [2025-04-14 14:11:28,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:28,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:28,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 14:11:28,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 14:11:28,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:28,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:28,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:28,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785294413] [2025-04-14 14:11:28,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785294413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:28,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:28,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 14:11:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984881291] [2025-04-14 14:11:28,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:28,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 14:11:28,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:28,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 14:11:28,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 14:11:28,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:28,960 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:28,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:11:28,962 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:29,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:29,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 14:11:29,028 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:29,028 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:29,028 INFO L139 ounterexampleChecker]: Examining path program with hash -83696657, occurence #1 [2025-04-14 14:11:29,028 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:29,028 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:29,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash -976939448, now seen corresponding path program 1 times [2025-04-14 14:11:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:29,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815730709] [2025-04-14 14:11:29,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:29,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 14:11:29,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 14:11:29,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:29,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:29,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:29,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815730709] [2025-04-14 14:11:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815730709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:29,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:29,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 14:11:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93571545] [2025-04-14 14:11:29,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:29,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 14:11:29,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:29,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 14:11:29,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-14 14:11:29,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:29,826 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:29,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:11:29,827 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:29,827 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:30,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:30,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:30,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 14:11:30,060 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:30,060 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:30,060 INFO L139 ounterexampleChecker]: Examining path program with hash -1254266254, occurence #1 [2025-04-14 14:11:30,060 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:30,060 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:30,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:30,061 INFO L85 PathProgramCache]: Analyzing trace with hash 168475734, now seen corresponding path program 1 times [2025-04-14 14:11:30,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:30,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044724147] [2025-04-14 14:11:30,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:30,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:30,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-14 14:11:30,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 14:11:30,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:30,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:30,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:30,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044724147] [2025-04-14 14:11:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044724147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:30,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:30,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 14:11:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378693947] [2025-04-14 14:11:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:30,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:11:30,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:30,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:11:30,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:11:30,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:30,281 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:30,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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) [2025-04-14 14:11:30,281 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:30,281 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:30,281 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:30,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:30,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:30,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:30,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 14:11:30,341 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:30,341 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:30,341 INFO L139 ounterexampleChecker]: Examining path program with hash 743000474, occurence #1 [2025-04-14 14:11:30,341 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:30,341 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:30,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1020261428, now seen corresponding path program 1 times [2025-04-14 14:11:30,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:30,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448770237] [2025-04-14 14:11:30,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:30,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:30,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 14:11:30,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 14:11:30,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:30,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:31,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:31,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:31,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448770237] [2025-04-14 14:11:31,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448770237] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:11:31,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508549316] [2025-04-14 14:11:31,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:31,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:11:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:11:31,126 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:11:31,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 14:11:31,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 14:11:31,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 14:11:31,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:31,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:31,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 14:11:31,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:11:31,587 INFO L325 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-04-14 14:11:31,587 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-14 14:11:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:31,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:11:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508549316] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:11:31,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:11:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 26 [2025-04-14 14:11:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519230712] [2025-04-14 14:11:31,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:11:31,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 14:11:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:31,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 14:11:31,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=630, Unknown=7, NotChecked=0, Total=756 [2025-04-14 14:11:31,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:31,896 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:31,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:11:31,896 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:31,896 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:31,896 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:31,896 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:32,034 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_~#top~0.base| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base|)) (.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_1) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (= c_~next_alloc_idx~0 3) (= |c_~#top~0.offset| 0) (= |c_thr1Thread1of1ForFork0_push_~newTop~0#1| 1) (not (= |c_thr1Thread1of1ForFork0_push_~newTop~0#1| 0)) (or (not .cse1) (= |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| |c_~#top~0.offset|)) (or .cse1 .cse0) (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)))) (store .cse2 |thr1Thread1of1ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0))))) is different from false [2025-04-14 14:11:32,038 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_~#top~0.base| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base|)) (.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_1) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (= c_~next_alloc_idx~0 3) (= |c_~#top~0.offset| 0) (not (= |c_thr1Thread1of1ForFork0_push_~newTop~0#1| 0)) (or (not .cse1) (= |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| |c_~#top~0.offset|)) (or .cse1 .cse0) (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)))) (store .cse2 |thr1Thread1of1ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0))))) is different from false [2025-04-14 14:11:32,495 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_~#top~0.base| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base|)) (.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_1) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (= |c_~#top~0.offset| 0) (not (= |c_thr1Thread1of1ForFork0_push_~newTop~0#1| 0)) (not (= (+ c_~next_alloc_idx~0 2) 0)) (not (= c_~next_alloc_idx~0 0)) (or (not .cse1) (= |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| |c_~#top~0.offset|)) (or .cse1 .cse0) (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)))) (store .cse2 |thr1Thread1of1ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0))))) is different from false [2025-04-14 14:11:32,498 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_~#top~0.base| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base|)) (.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_1) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (= |c_~#top~0.offset| 0) (not (= |c_thr1Thread1of1ForFork0_push_~newTop~0#1| 0)) (not (= c_~next_alloc_idx~0 0)) (or (not .cse1) (= |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| |c_~#top~0.offset|)) (or .cse1 .cse0) (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)))) (store .cse2 |thr1Thread1of1ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0))))) is different from false [2025-04-14 14:11:32,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:32,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:32,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:32,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 14:11:32,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 14:11:32,744 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-14 14:11:32,745 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:32,745 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:32,745 INFO L139 ounterexampleChecker]: Examining path program with hash -403935668, occurence #1 [2025-04-14 14:11:32,745 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:32,745 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:32,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1163125490, now seen corresponding path program 1 times [2025-04-14 14:11:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:32,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009941050] [2025-04-14 14:11:32,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:32,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:32,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-14 14:11:32,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-14 14:11:32,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:32,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-04-14 14:11:33,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:33,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009941050] [2025-04-14 14:11:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009941050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:33,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:33,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 14:11:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192372126] [2025-04-14 14:11:33,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:33,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 14:11:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:33,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 14:11:33,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 14:11:33,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:33,023 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:33,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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) [2025-04-14 14:11:33,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:33,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:33,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:33,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-04-14 14:11:33,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:33,277 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (= |c_~#top~0.base| |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base|)) (.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_1) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (= |c_~#top~0.offset| 0) (not (= |c_thr1Thread1of1ForFork0_push_~newTop~0#1| 0)) (or (not .cse1) (= |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| |c_~#top~0.offset|)) (or .cse1 .cse0) (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int)) (not (= (select (select (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_~newTop~0#1|)))) (store .cse2 |thr1Thread1of1ForFork0_push_~#casret~0#1.base| (store (select .cse2 |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0))))) is different from false [2025-04-14 14:11:33,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:33,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:33,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:33,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-14 14:11:33,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:33,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 14:11:33,384 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:33,384 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:33,384 INFO L139 ounterexampleChecker]: Examining path program with hash -403935668, occurence #2 [2025-04-14 14:11:33,384 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 14:11:33,384 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 14:11:33,385 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,385 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 14:11:33,385 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:11:33,385 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-14 14:11:33,385 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,385 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 14:11:33,385 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,385 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 14:11:33,385 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,385 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 37 [2025-04-14 14:11:33,385 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,385 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 49 [2025-04-14 14:11:33,385 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,386 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 51 [2025-04-14 14:11:33,386 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,386 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 62 [2025-04-14 14:11:33,386 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,386 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 64 [2025-04-14 14:11:33,386 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,386 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 14:11:33,386 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:33,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1042708994, now seen corresponding path program 1 times [2025-04-14 14:11:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:33,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705448216] [2025-04-14 14:11:33,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:33,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-14 14:11:33,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-14 14:11:33,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:33,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-04-14 14:11:33,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:33,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705448216] [2025-04-14 14:11:33,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705448216] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:33,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:33,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 14:11:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137566839] [2025-04-14 14:11:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:33,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:11:33,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:33,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:11:33,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:11:33,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:33,621 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:33,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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) [2025-04-14 14:11:33,622 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:33,622 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:33,622 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:33,622 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2025-04-14 14:11:33,622 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:33,622 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:33,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:33,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:33,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:33,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-14 14:11:33,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:33,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:33,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 14:11:33,691 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:33,691 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:33,691 INFO L139 ounterexampleChecker]: Examining path program with hash -403935668, occurence #3 [2025-04-14 14:11:33,691 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 14:11:33,691 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 14:11:33,691 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,691 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 14:11:33,691 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:11:33,692 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-14 14:11:33,692 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,692 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 14:11:33,692 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,692 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 14:11:33,692 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,692 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 37 [2025-04-14 14:11:33,692 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:33,692 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 14:11:33,692 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:33,692 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:33,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1257923070, now seen corresponding path program 2 times [2025-04-14 14:11:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:33,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737985720] [2025-04-14 14:11:33,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:11:33,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:33,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-14 14:11:34,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 14:11:34,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 14:11:34,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:34,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:34,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737985720] [2025-04-14 14:11:34,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737985720] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:11:34,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037340829] [2025-04-14 14:11:34,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:11:34,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:11:34,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:11:34,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:11:34,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 14:11:34,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-14 14:11:34,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 14:11:34,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 14:11:34,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:34,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 14:11:34,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:11:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:34,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:11:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:34,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037340829] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:11:34,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:11:34,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-14 14:11:34,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606501702] [2025-04-14 14:11:34,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:11:34,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 14:11:34,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:34,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 14:11:34,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-14 14:11:34,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:34,467 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:34,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:11:34,467 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:34,467 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:34,467 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:34,467 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2025-04-14 14:11:34,467 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:34,467 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:34,467 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:34,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:34,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:34,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:34,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-14 14:11:34,635 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:34,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:34,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:34,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 14:11:34,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:11:34,836 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:34,836 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:34,837 INFO L139 ounterexampleChecker]: Examining path program with hash -403935668, occurence #4 [2025-04-14 14:11:34,837 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 14:11:34,837 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 14:11:34,837 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,837 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 14:11:34,837 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:11:34,837 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-14 14:11:34,837 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,837 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 14:11:34,837 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,837 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 14:11:34,837 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,837 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 37 [2025-04-14 14:11:34,837 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,837 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 48 [2025-04-14 14:11:34,837 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,837 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 50 [2025-04-14 14:11:34,837 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,837 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 61 [2025-04-14 14:11:34,837 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,838 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 63 [2025-04-14 14:11:34,838 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,838 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 74 [2025-04-14 14:11:34,838 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,838 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 76 [2025-04-14 14:11:34,838 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,838 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 87 [2025-04-14 14:11:34,838 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,838 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 89 [2025-04-14 14:11:34,838 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:11:34,838 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 14:11:34,838 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:34,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:34,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1934955774, now seen corresponding path program 3 times [2025-04-14 14:11:34,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:34,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567095669] [2025-04-14 14:11:34,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 14:11:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:35,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 99 statements into 6 equivalence classes. [2025-04-14 14:11:35,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 47 of 99 statements. [2025-04-14 14:11:35,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 14:11:35,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-04-14 14:11:35,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:35,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567095669] [2025-04-14 14:11:35,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567095669] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:35,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:35,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 14:11:35,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856063722] [2025-04-14 14:11:35,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:35,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:11:35,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:35,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:11:35,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:11:35,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:35,237 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:35,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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) [2025-04-14 14:11:35,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:35,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:35,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:35,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2025-04-14 14:11:35,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:35,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:35,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:35,237 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:35,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:35,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 14:11:35,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:35,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-14 14:11:35,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:35,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:35,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:35,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:35,604 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 14:11:35,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 14:11:35,608 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-04-14 14:11:35,609 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2025-04-14 14:11:35,611 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:11:35,611 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 14:11:35,611 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 14:11:35,611 INFO L340 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;@3531a6b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:11:35,611 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 14:11:35,615 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:11:35,615 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:35,615 INFO L139 ounterexampleChecker]: Examining path program with hash 1859477566, occurence #1 [2025-04-14 14:11:35,615 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:35,615 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:35,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:35,615 INFO L85 PathProgramCache]: Analyzing trace with hash -251800469, now seen corresponding path program 1 times [2025-04-14 14:11:35,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:35,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734263181] [2025-04-14 14:11:35,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:35,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:35,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 14:11:35,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 14:11:35,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:35,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:35,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:35,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734263181] [2025-04-14 14:11:35,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734263181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:35,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:35,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 14:11:35,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756748342] [2025-04-14 14:11:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:35,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 14:11:35,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:35,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 14:11:35,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 14:11:35,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:35,812 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:35,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2025-04-14 14:11:35,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:35,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:35,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 14:11:35,835 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:11:35,835 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:35,835 INFO L139 ounterexampleChecker]: Examining path program with hash -859924637, occurence #1 [2025-04-14 14:11:35,835 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:35,835 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:35,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash 519294643, now seen corresponding path program 1 times [2025-04-14 14:11:35,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:35,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255559486] [2025-04-14 14:11:35,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:35,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:36,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 14:11:36,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 14:11:36,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:36,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:36,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:36,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255559486] [2025-04-14 14:11:36,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255559486] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:36,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:36,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 14:11:36,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210906793] [2025-04-14 14:11:36,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:36,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 14:11:36,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:36,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 14:11:36,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 14:11:36,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:36,048 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:36,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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) [2025-04-14 14:11:36,048 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:36,048 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:36,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:36,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:36,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 14:11:36,067 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:11:36,067 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:36,067 INFO L139 ounterexampleChecker]: Examining path program with hash -1880806996, occurence #1 [2025-04-14 14:11:36,067 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:36,067 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:36,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1570354129, now seen corresponding path program 1 times [2025-04-14 14:11:36,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:36,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481745465] [2025-04-14 14:11:36,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:36,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 14:11:36,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 14:11:36,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:36,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:11:36,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 14:11:36,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 14:11:36,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 14:11:36,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:36,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:11:36,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 14:11:36,276 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 14:11:36,277 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-14 14:11:36,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 14:11:36,277 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-14 14:11:36,278 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2025-04-14 14:11:36,278 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 14:11:36,278 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 14:11:36,307 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 14:11:36,309 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:11:36,322 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 14:11:36,323 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 14:11:36,323 INFO L340 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;@3531a6b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:11:36,323 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 14:11:36,891 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:11:36,892 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:36,892 INFO L139 ounterexampleChecker]: Examining path program with hash -1150151682, occurence #1 [2025-04-14 14:11:36,892 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:36,892 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:36,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:36,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2047166272, now seen corresponding path program 1 times [2025-04-14 14:11:36,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:36,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196958026] [2025-04-14 14:11:36,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:36,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:37,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 14:11:37,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 14:11:37,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:37,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:37,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:37,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196958026] [2025-04-14 14:11:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196958026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:37,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:37,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 14:11:37,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988993344] [2025-04-14 14:11:37,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:37,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 14:11:37,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:37,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 14:11:37,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 14:11:37,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:37,101 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:37,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2025-04-14 14:11:37,101 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:37,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:37,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 14:11:37,849 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:11:37,850 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:37,850 INFO L139 ounterexampleChecker]: Examining path program with hash 2072345549, occurence #1 [2025-04-14 14:11:37,850 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:37,850 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:37,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1258166787, now seen corresponding path program 1 times [2025-04-14 14:11:37,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:37,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609747567] [2025-04-14 14:11:37,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:37,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:38,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 14:11:38,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 14:11:38,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:38,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:38,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:38,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609747567] [2025-04-14 14:11:38,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609747567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:38,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:38,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 14:11:38,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705716366] [2025-04-14 14:11:38,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:38,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 14:11:38,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:38,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 14:11:38,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 14:11:38,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,040 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:38,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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) [2025-04-14 14:11:38,040 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,040 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:38,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 14:11:38,086 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:11:38,086 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:38,086 INFO L139 ounterexampleChecker]: Examining path program with hash -398672492, occurence #1 [2025-04-14 14:11:38,086 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:38,086 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:38,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:38,086 INFO L85 PathProgramCache]: Analyzing trace with hash -273546923, now seen corresponding path program 1 times [2025-04-14 14:11:38,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:38,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488583443] [2025-04-14 14:11:38,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:38,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:38,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-14 14:11:38,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 14:11:38,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:38,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:38,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:38,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488583443] [2025-04-14 14:11:38,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488583443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:38,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:38,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 14:11:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215700022] [2025-04-14 14:11:38,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:38,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 14:11:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:38,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 14:11:38,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 14:11:38,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,295 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:38,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) [2025-04-14 14:11:38,295 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,295 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:38,295 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:38,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:38,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 14:11:38,526 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:11:38,526 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:38,526 INFO L139 ounterexampleChecker]: Examining path program with hash 1247577692, occurence #1 [2025-04-14 14:11:38,526 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:38,526 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:38,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:38,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2035679694, now seen corresponding path program 1 times [2025-04-14 14:11:38,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:38,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583126451] [2025-04-14 14:11:38,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:38,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:38,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-14 14:11:38,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-14 14:11:38,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:38,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:38,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:38,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583126451] [2025-04-14 14:11:38,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583126451] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:38,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:38,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 14:11:38,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131204595] [2025-04-14 14:11:38,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:38,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:11:38,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:38,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:11:38,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:11:38,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,723 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:38,723 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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) [2025-04-14 14:11:38,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:38,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:38,723 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:38,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:38,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:38,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:38,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 14:11:38,774 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:11:38,774 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:38,774 INFO L139 ounterexampleChecker]: Examining path program with hash -28410331, occurence #1 [2025-04-14 14:11:38,774 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:38,774 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:38,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1698653013, now seen corresponding path program 1 times [2025-04-14 14:11:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:38,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578083455] [2025-04-14 14:11:38,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:38,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:38,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 14:11:38,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 14:11:38,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:38,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:39,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:39,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578083455] [2025-04-14 14:11:39,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578083455] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:39,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:39,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-14 14:11:39,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270001012] [2025-04-14 14:11:39,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:39,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 14:11:39,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:39,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 14:11:39,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-14 14:11:39,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:39,227 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:39,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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) [2025-04-14 14:11:39,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:39,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:39,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:39,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:39,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:39,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:39,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:39,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:39,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:39,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:39,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 14:11:39,638 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 14:11:39,638 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:39,638 INFO L139 ounterexampleChecker]: Examining path program with hash -2010590893, occurence #1 [2025-04-14 14:11:39,638 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:39,638 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:39,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash 788859820, now seen corresponding path program 1 times [2025-04-14 14:11:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:39,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380982439] [2025-04-14 14:11:39,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:39,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 14:11:39,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 14:11:39,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:39,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:11:39,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 14:11:39,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 14:11:39,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 14:11:39,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:39,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 14:11:39,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 14:11:39,856 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 14:11:39,857 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2025-04-14 14:11:39,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 14:11:39,858 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-14 14:11:39,858 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2025-04-14 14:11:39,858 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 14:11:39,858 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-14 14:11:39,922 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 14:11:39,925 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:11:39,942 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 14:11:39,942 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2025-04-14 14:11:39,943 INFO L340 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;@3531a6b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 14:11:39,943 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 14:11:41,135 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:41,136 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:41,136 INFO L139 ounterexampleChecker]: Examining path program with hash 802412941, occurence #1 [2025-04-14 14:11:41,136 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:41,136 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:41,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1381201672, now seen corresponding path program 1 times [2025-04-14 14:11:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:41,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126057852] [2025-04-14 14:11:41,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:41,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 14:11:41,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 14:11:41,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:41,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:41,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:41,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126057852] [2025-04-14 14:11:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126057852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:41,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:41,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 14:11:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184397332] [2025-04-14 14:11:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:41,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 14:11:41,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:41,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 14:11:41,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 14:11:41,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:41,311 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:41,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 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) [2025-04-14 14:11:41,311 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:43,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:43,394 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 14:11:43,394 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:43,394 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:43,394 INFO L139 ounterexampleChecker]: Examining path program with hash 184770513, occurence #1 [2025-04-14 14:11:43,394 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:43,394 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:43,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:43,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1561431121, now seen corresponding path program 1 times [2025-04-14 14:11:43,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:43,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058587000] [2025-04-14 14:11:43,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:43,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:43,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-14 14:11:43,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-14 14:11:43,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:43,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:43,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:43,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058587000] [2025-04-14 14:11:43,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058587000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:43,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:43,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 14:11:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782818639] [2025-04-14 14:11:43,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:43,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 14:11:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:43,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 14:11:43,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 14:11:43,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:43,633 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:43,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 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) [2025-04-14 14:11:43,633 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:43,633 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:43,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:43,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:43,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 14:11:43,718 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:43,718 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:43,718 INFO L139 ounterexampleChecker]: Examining path program with hash -671914828, occurence #1 [2025-04-14 14:11:43,718 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:43,718 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:43,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2034947518, now seen corresponding path program 1 times [2025-04-14 14:11:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:43,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701086521] [2025-04-14 14:11:43,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:43,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:43,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-14 14:11:43,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-14 14:11:43,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:43,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:44,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:44,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701086521] [2025-04-14 14:11:44,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701086521] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:44,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:44,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 14:11:44,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102021394] [2025-04-14 14:11:44,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:44,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 14:11:44,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:44,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 14:11:44,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 14:11:44,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:44,019 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:44,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:11:44,019 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:44,019 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:44,019 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:44,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:44,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:44,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:44,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 14:11:44,287 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:44,287 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:44,287 INFO L139 ounterexampleChecker]: Examining path program with hash 2022898977, occurence #1 [2025-04-14 14:11:44,287 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:44,288 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:44,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:44,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1996242469, now seen corresponding path program 1 times [2025-04-14 14:11:44,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:44,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708394657] [2025-04-14 14:11:44,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:44,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:44,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-14 14:11:44,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-14 14:11:44,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:44,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:44,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708394657] [2025-04-14 14:11:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708394657] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:44,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:44,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 14:11:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642032946] [2025-04-14 14:11:44,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:44,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:11:44,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:44,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:11:44,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:11:44,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:44,503 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:44,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 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) [2025-04-14 14:11:44,503 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:44,503 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:44,503 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:44,503 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:44,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:44,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:44,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:44,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:44,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 14:11:44,592 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:44,592 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:44,592 INFO L139 ounterexampleChecker]: Examining path program with hash -902889015, occurence #1 [2025-04-14 14:11:44,592 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:44,592 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:44,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1963048451, now seen corresponding path program 1 times [2025-04-14 14:11:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:44,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919530069] [2025-04-14 14:11:44,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:44,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:44,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-14 14:11:44,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-14 14:11:44,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:44,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:44,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:44,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919530069] [2025-04-14 14:11:44,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919530069] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:44,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:44,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 14:11:44,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029801293] [2025-04-14 14:11:44,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:44,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 14:11:44,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:44,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 14:11:44,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 14:11:44,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:44,828 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:44,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:11:44,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:44,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:44,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:44,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:44,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:45,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:45,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:45,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:45,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:45,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:45,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 14:11:45,112 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:45,112 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:45,112 INFO L139 ounterexampleChecker]: Examining path program with hash 625781772, occurence #1 [2025-04-14 14:11:45,112 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:45,112 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:45,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:45,112 INFO L85 PathProgramCache]: Analyzing trace with hash 224138398, now seen corresponding path program 1 times [2025-04-14 14:11:45,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:45,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577126137] [2025-04-14 14:11:45,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:45,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:45,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-14 14:11:45,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-14 14:11:45,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:45,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:45,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:45,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577126137] [2025-04-14 14:11:45,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577126137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:45,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:45,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 14:11:45,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990065843] [2025-04-14 14:11:45,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:45,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 14:11:45,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:45,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 14:11:45,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 14:11:45,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:45,342 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:45,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 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) [2025-04-14 14:11:45,342 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:45,342 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:45,342 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:45,342 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:45,342 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:45,343 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:45,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:45,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:45,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:45,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:45,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:45,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:45,425 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 14:11:45,425 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:45,425 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:45,426 INFO L139 ounterexampleChecker]: Examining path program with hash 1580221506, occurence #1 [2025-04-14 14:11:45,426 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:45,426 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:45,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:45,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1826984264, now seen corresponding path program 1 times [2025-04-14 14:11:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:45,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880430963] [2025-04-14 14:11:45,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:45,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:45,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-14 14:11:45,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-14 14:11:45,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:45,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:45,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:45,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880430963] [2025-04-14 14:11:45,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880430963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:45,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:45,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-14 14:11:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343885405] [2025-04-14 14:11:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:45,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 14:11:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:45,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 14:11:45,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-14 14:11:45,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:45,931 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:45,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:11:45,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:45,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:45,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:45,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:45,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:45,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:45,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:46,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:46,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:46,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:46,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:46,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:46,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:46,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:46,764 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 14:11:46,764 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:46,764 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:46,765 INFO L139 ounterexampleChecker]: Examining path program with hash 339918583, occurence #1 [2025-04-14 14:11:46,765 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:46,765 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:46,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash -42193197, now seen corresponding path program 1 times [2025-04-14 14:11:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:46,765 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263984683] [2025-04-14 14:11:46,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:46,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-14 14:11:46,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-14 14:11:46,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:46,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:47,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:47,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263984683] [2025-04-14 14:11:47,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263984683] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:47,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:47,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 14:11:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951905498] [2025-04-14 14:11:47,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:47,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 14:11:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:47,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 14:11:47,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 14:11:47,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:47,025 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:47,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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) [2025-04-14 14:11:47,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:47,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:47,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:47,026 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,026 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,026 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:47,026 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:47,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:47,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:47,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:47,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:47,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 14:11:47,156 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:47,156 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:47,156 INFO L139 ounterexampleChecker]: Examining path program with hash -628821897, occurence #1 [2025-04-14 14:11:47,156 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:47,156 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:47,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:47,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1794201105, now seen corresponding path program 1 times [2025-04-14 14:11:47,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:47,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993555922] [2025-04-14 14:11:47,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:47,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:47,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-14 14:11:47,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-14 14:11:47,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:47,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:47,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993555922] [2025-04-14 14:11:47,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993555922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:47,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:47,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 14:11:47,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693430163] [2025-04-14 14:11:47,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:47,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 14:11:47,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:47,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 14:11:47,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-14 14:11:47,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:47,478 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:47,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 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) [2025-04-14 14:11:47,478 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:47,478 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:47,478 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,478 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:47,478 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,478 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,478 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:47,478 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,478 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:47,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:47,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:47,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:47,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:47,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:47,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:47,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 14:11:47,591 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:47,591 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:47,591 INFO L139 ounterexampleChecker]: Examining path program with hash 751619513, occurence #1 [2025-04-14 14:11:47,591 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:47,591 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:47,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash -487782637, now seen corresponding path program 1 times [2025-04-14 14:11:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:47,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859458546] [2025-04-14 14:11:47,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:47,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-14 14:11:47,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-14 14:11:47,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:47,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:11:48,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:48,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859458546] [2025-04-14 14:11:48,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859458546] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:48,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:48,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-14 14:11:48,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120828548] [2025-04-14 14:11:48,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:48,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 14:11:48,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:48,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 14:11:48,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-14 14:11:48,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:48,127 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:48,127 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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) [2025-04-14 14:11:48,127 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:48,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:48,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:48,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:48,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:48,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:48,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:48,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:48,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:48,128 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:48,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:48,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:48,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:48,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:48,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:48,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:48,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:48,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:48,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:48,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:48,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 14:11:48,880 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:48,880 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:48,880 INFO L139 ounterexampleChecker]: Examining path program with hash -586252331, occurence #1 [2025-04-14 14:11:48,880 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:48,880 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:48,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:48,880 INFO L85 PathProgramCache]: Analyzing trace with hash -796785404, now seen corresponding path program 1 times [2025-04-14 14:11:48,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:48,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238299840] [2025-04-14 14:11:48,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:48,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:49,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-04-14 14:11:49,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-04-14 14:11:49,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:49,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 14:11:49,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:49,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238299840] [2025-04-14 14:11:49,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238299840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:49,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:49,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 14:11:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768086294] [2025-04-14 14:11:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:49,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:11:49,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:49,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:11:49,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:11:49,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:49,134 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:49,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2025-04-14 14:11:49,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:49,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:49,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:49,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:49,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:49,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:49,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:49,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:49,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:49,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:49,135 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:50,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:50,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:50,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:50,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:50,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:50,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:50,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:50,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:50,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:50,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:50,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:50,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 14:11:50,162 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:50,162 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:50,162 INFO L139 ounterexampleChecker]: Examining path program with hash 826111852, occurence #1 [2025-04-14 14:11:50,162 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:50,162 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:50,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:50,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2102150642, now seen corresponding path program 1 times [2025-04-14 14:11:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:50,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652809585] [2025-04-14 14:11:50,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:50,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:50,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-04-14 14:11:50,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-04-14 14:11:50,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:50,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-14 14:11:50,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:50,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652809585] [2025-04-14 14:11:50,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652809585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:50,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:50,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 14:11:50,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536754940] [2025-04-14 14:11:50,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:50,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 14:11:50,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:50,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 14:11:50,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 14:11:50,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:50,589 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:50,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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) [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:50,589 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:51,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 14:11:51,316 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:51,316 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:51,316 INFO L139 ounterexampleChecker]: Examining path program with hash 811594915, occurence #1 [2025-04-14 14:11:51,316 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:51,316 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:51,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:51,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1434437990, now seen corresponding path program 2 times [2025-04-14 14:11:51,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:51,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043189508] [2025-04-14 14:11:51,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:11:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:51,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 202 statements into 2 equivalence classes. [2025-04-14 14:11:51,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 87 of 202 statements. [2025-04-14 14:11:51,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 14:11:51,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-04-14 14:11:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:51,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043189508] [2025-04-14 14:11:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043189508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:51,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:51,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 14:11:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062682282] [2025-04-14 14:11:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:51,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:11:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:51,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:11:51,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:11:51,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:51,576 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:51,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:51,576 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:51,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:51,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-14 14:11:51,731 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:51,731 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:51,732 INFO L139 ounterexampleChecker]: Examining path program with hash -812396898, occurence #1 [2025-04-14 14:11:51,732 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:51,732 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:51,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:51,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2006697378, now seen corresponding path program 1 times [2025-04-14 14:11:51,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:51,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619790679] [2025-04-14 14:11:51,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:51,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:51,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-14 14:11:51,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-14 14:11:51,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:51,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-14 14:11:52,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:52,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619790679] [2025-04-14 14:11:52,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619790679] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:52,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:52,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 14:11:52,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505753837] [2025-04-14 14:11:52,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:52,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 14:11:52,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:52,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 14:11:52,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 14:11:52,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:52,066 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:52,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 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) [2025-04-14 14:11:52,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:52,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:52,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:52,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:52,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:52,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:52,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:52,066 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,067 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:52,067 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:52,067 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:52,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:52,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:52,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-14 14:11:52,183 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:52,183 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:52,183 INFO L139 ounterexampleChecker]: Examining path program with hash -1879178359, occurence #1 [2025-04-14 14:11:52,183 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:52,183 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:52,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:52,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1514616234, now seen corresponding path program 2 times [2025-04-14 14:11:52,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:52,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247189618] [2025-04-14 14:11:52,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:11:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:52,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-04-14 14:11:52,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 82 of 158 statements. [2025-04-14 14:11:52,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 14:11:52,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-14 14:11:52,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:52,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247189618] [2025-04-14 14:11:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247189618] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:52,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-14 14:11:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863879101] [2025-04-14 14:11:52,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:52,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 14:11:52,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:52,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 14:11:52,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-14 14:11:52,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:52,669 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:52,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 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) [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:52,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:53,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:53,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-14 14:11:53,892 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:53,892 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:53,892 INFO L139 ounterexampleChecker]: Examining path program with hash -632401381, occurence #1 [2025-04-14 14:11:53,892 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:53,892 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:53,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash 696130409, now seen corresponding path program 1 times [2025-04-14 14:11:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:53,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320070464] [2025-04-14 14:11:53,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:53,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:54,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-04-14 14:11:54,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-04-14 14:11:54,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:54,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-14 14:11:54,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:54,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320070464] [2025-04-14 14:11:54,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320070464] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:54,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:54,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 14:11:54,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154659682] [2025-04-14 14:11:54,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:54,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 14:11:54,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:54,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 14:11:54,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-14 14:11:54,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:54,191 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:54,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 7 states have internal predecessors, (123), 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) [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:54,191 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:54,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:54,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:54,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:54,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:54,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:54,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:54,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:54,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:54,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:54,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:54,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:54,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:54,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-14 14:11:54,326 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:54,326 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:54,327 INFO L139 ounterexampleChecker]: Examining path program with hash -1699182842, occurence #1 [2025-04-14 14:11:54,327 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:54,327 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:54,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1491148719, now seen corresponding path program 2 times [2025-04-14 14:11:54,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:54,327 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828107298] [2025-04-14 14:11:54,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:11:54,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:54,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-04-14 14:11:54,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 95 of 171 statements. [2025-04-14 14:11:54,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 14:11:54,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-14 14:11:54,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:54,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828107298] [2025-04-14 14:11:54,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828107298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:54,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:54,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-14 14:11:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225612260] [2025-04-14 14:11:54,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:54,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 14:11:54,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:54,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 14:11:54,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-14 14:11:54,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:54,867 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:54,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:54,867 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:56,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:56,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:11:56,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-14 14:11:56,584 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:56,584 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:56,585 INFO L139 ounterexampleChecker]: Examining path program with hash -1427720149, occurence #1 [2025-04-14 14:11:56,585 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:56,585 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:56,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash 419066116, now seen corresponding path program 1 times [2025-04-14 14:11:56,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:56,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010947290] [2025-04-14 14:11:56,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:56,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:56,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-04-14 14:11:56,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-04-14 14:11:56,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:56,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-14 14:11:56,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:56,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010947290] [2025-04-14 14:11:56,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010947290] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:56,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:56,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 14:11:56,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222457295] [2025-04-14 14:11:56,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:56,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:11:56,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:56,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:11:56,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:11:56,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:56,888 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:56,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:11:56,888 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:11:57,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-14 14:11:57,294 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:57,294 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:57,294 INFO L139 ounterexampleChecker]: Examining path program with hash 1063097244, occurence #1 [2025-04-14 14:11:57,294 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:57,294 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:57,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:57,294 INFO L85 PathProgramCache]: Analyzing trace with hash -411266558, now seen corresponding path program 1 times [2025-04-14 14:11:57,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:57,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473922619] [2025-04-14 14:11:57,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:57,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:57,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-04-14 14:11:57,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-04-14 14:11:57,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:57,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-14 14:11:57,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:57,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473922619] [2025-04-14 14:11:57,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473922619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:57,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:57,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 14:11:57,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485893467] [2025-04-14 14:11:57,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:57,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:11:57,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:57,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:11:57,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:11:57,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:57,579 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:57,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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) [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:57,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:57,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:57,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-14 14:11:57,994 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:57,994 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:57,995 INFO L139 ounterexampleChecker]: Examining path program with hash -1540862625, occurence #1 [2025-04-14 14:11:57,995 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:57,995 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:57,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:57,995 INFO L85 PathProgramCache]: Analyzing trace with hash 248370557, now seen corresponding path program 1 times [2025-04-14 14:11:57,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:57,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747843817] [2025-04-14 14:11:57,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:57,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:58,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-04-14 14:11:58,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-04-14 14:11:58,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:58,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-14 14:11:58,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:58,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747843817] [2025-04-14 14:11:58,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747843817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:58,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:58,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 14:11:58,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708162046] [2025-04-14 14:11:58,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:58,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 14:11:58,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:58,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 14:11:58,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 14:11:58,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:58,280 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:58,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:58,280 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:58,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:58,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:58,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:58,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:11:58,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:58,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:58,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-14 14:11:58,383 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:58,383 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:58,383 INFO L139 ounterexampleChecker]: Examining path program with hash 1405705871, occurence #1 [2025-04-14 14:11:58,383 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:58,383 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:58,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash -935386873, now seen corresponding path program 2 times [2025-04-14 14:11:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:58,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261106806] [2025-04-14 14:11:58,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:11:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:58,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 240 statements into 2 equivalence classes. [2025-04-14 14:11:58,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 150 of 240 statements. [2025-04-14 14:11:58,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 14:11:58,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-14 14:11:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:58,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261106806] [2025-04-14 14:11:58,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261106806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:58,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:58,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 14:11:58,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893528268] [2025-04-14 14:11:58,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:58,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:11:58,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:58,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:11:58,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:11:58,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:58,677 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:58,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 14:11:58,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:58,677 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:58,678 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:59,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:59,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:59,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:59,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:59,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:59,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:59,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:59,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:59,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:59,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:59,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:59,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:59,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:11:59,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:59,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:59,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-14 14:11:59,210 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:59,210 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:59,211 INFO L139 ounterexampleChecker]: Examining path program with hash 1788018769, occurence #1 [2025-04-14 14:11:59,211 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:59,211 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:59,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 279415159, now seen corresponding path program 1 times [2025-04-14 14:11:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:59,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290094661] [2025-04-14 14:11:59,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:11:59,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:59,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-04-14 14:11:59,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-04-14 14:11:59,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:11:59,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:11:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-04-14 14:11:59,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:11:59,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290094661] [2025-04-14 14:11:59,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290094661] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:11:59,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:11:59,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 14:11:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123748842] [2025-04-14 14:11:59,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:11:59,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 14:11:59,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:11:59,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 14:11:59,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-14 14:11:59,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:59,655 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:11:59,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 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) [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:59,655 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:59,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:59,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:59,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:11:59,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:59,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:59,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,656 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:59,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:11:59,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:59,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:59,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:11:59,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:11:59,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:11:59,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-14 14:11:59,818 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:11:59,818 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:11:59,818 INFO L139 ounterexampleChecker]: Examining path program with hash 1827095206, occurence #1 [2025-04-14 14:11:59,819 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:11:59,819 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:11:59,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:11:59,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1780639017, now seen corresponding path program 2 times [2025-04-14 14:11:59,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:11:59,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618266186] [2025-04-14 14:11:59,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:11:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:11:59,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 287 statements into 2 equivalence classes. [2025-04-14 14:12:00,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 148 of 287 statements. [2025-04-14 14:12:00,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 14:12:00,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:12:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-04-14 14:12:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:12:00,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618266186] [2025-04-14 14:12:00,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618266186] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:12:00,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:12:00,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 14:12:00,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920641715] [2025-04-14 14:12:00,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:12:00,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 14:12:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:12:00,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 14:12:00,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 14:12:00,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:00,365 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:12:00,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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) [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:12:00,365 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:02,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:02,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:02,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:02,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:02,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:02,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:02,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:12:02,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:12:02,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:02,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-14 14:12:02,738 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:12:02,738 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:12:02,739 INFO L139 ounterexampleChecker]: Examining path program with hash 865009605, occurence #1 [2025-04-14 14:12:02,739 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:12:02,739 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:12:02,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:12:02,739 INFO L85 PathProgramCache]: Analyzing trace with hash -994873527, now seen corresponding path program 1 times [2025-04-14 14:12:02,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:12:02,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532778004] [2025-04-14 14:12:02,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:12:02,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:12:02,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-04-14 14:12:02,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-04-14 14:12:02,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:12:02,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:12:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:12:03,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:12:03,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532778004] [2025-04-14 14:12:03,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532778004] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:12:03,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231560301] [2025-04-14 14:12:03,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:12:03,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:12:03,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:12:03,185 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:12:03,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 14:12:03,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-04-14 14:12:03,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-04-14 14:12:03,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:12:03,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:12:03,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 14:12:03,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:12:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:12:03,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:12:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:12:03,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231560301] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:12:03,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:12:03,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-14 14:12:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774766201] [2025-04-14 14:12:03,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:12:03,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 14:12:03,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:12:03,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 14:12:03,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-04-14 14:12:03,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:03,943 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:12:03,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 18 states have internal predecessors, (264), 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) [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:03,943 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:03,944 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:12:03,944 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:03,944 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:04,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:12:04,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:04,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:12:04,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 14:12:04,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:12:04,663 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:12:04,663 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:12:04,664 INFO L139 ounterexampleChecker]: Examining path program with hash 865009605, occurence #2 [2025-04-14 14:12:04,664 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 14:12:04,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 14:12:04,664 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 14:12:04,664 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:12:04,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-14 14:12:04,664 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:12:04,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-04-14 14:12:04,664 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 39 [2025-04-14 14:12:04,664 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:12:04,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 57 [2025-04-14 14:12:04,664 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 72 [2025-04-14 14:12:04,664 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 85 [2025-04-14 14:12:04,664 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,664 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 98 [2025-04-14 14:12:04,664 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 111 [2025-04-14 14:12:04,665 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 124 [2025-04-14 14:12:04,665 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 137 [2025-04-14 14:12:04,665 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 150 [2025-04-14 14:12:04,665 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 163 [2025-04-14 14:12:04,665 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 176 [2025-04-14 14:12:04,665 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 189 [2025-04-14 14:12:04,665 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 202 [2025-04-14 14:12:04,665 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 215 [2025-04-14 14:12:04,665 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 228 [2025-04-14 14:12:04,665 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 244 [2025-04-14 14:12:04,665 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:04,665 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 249 [2025-04-14 14:12:04,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:12:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash -131379727, now seen corresponding path program 1 times [2025-04-14 14:12:04,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 14:12:04,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096391817] [2025-04-14 14:12:04,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:12:04,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:12:04,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-04-14 14:12:04,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-04-14 14:12:04,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:12:04,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:12:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 8 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:12:05,426 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 14:12:05,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096391817] [2025-04-14 14:12:05,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096391817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:12:05,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1627380128] [2025-04-14 14:12:05,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:12:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:12:05,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-04-14 14:12:05,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-04-14 14:12:05,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:12:05,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:12:05,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-14 14:12:05,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:12:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 8 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:12:05,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1627380128] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:12:05,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 14:12:05,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2025-04-14 14:12:05,864 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 14:12:05,864 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 14:12:05,864 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:12:05,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:12:05,864 INFO L85 PathProgramCache]: Analyzing trace with hash 222154052, now seen corresponding path program 2 times [2025-04-14 14:12:05,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:12:05,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370574189] [2025-04-14 14:12:05,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:12:05,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:12:06,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 251 statements into 2 equivalence classes. [2025-04-14 14:12:06,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 251 of 251 statements. [2025-04-14 14:12:06,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 14:12:06,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:12:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 8 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:12:06,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:12:06,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370574189] [2025-04-14 14:12:06,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370574189] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:12:06,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352072882] [2025-04-14 14:12:06,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:12:06,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:12:06,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:12:06,616 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:12:06,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 14:12:07,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 251 statements into 2 equivalence classes. [2025-04-14 14:12:13,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 251 of 251 statements. [2025-04-14 14:12:13,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 14:12:13,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:12:13,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-14 14:12:13,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:12:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 8 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:12:13,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:12:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 8 proven. 274 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:12:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352072882] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:12:13,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:12:13,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2025-04-14 14:12:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593648831] [2025-04-14 14:12:13,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:12:13,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 14:12:13,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:12:13,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 14:12:13,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 14:12:13,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:13,542 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:12:13,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 13.45945945945946) internal successors, (498), 36 states have internal predecessors, (498), 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) [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:13,542 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-04-14 14:12:13,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:13,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:13,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:13,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:13,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:12:13,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:13,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:12:13,543 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:29,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:29,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:29,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:29,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:29,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:29,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:29,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:29,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:29,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:29,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:29,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:12:29,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:12:29,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 14:12:29,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-14 14:12:29,804 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:12:29,804 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:12:29,804 INFO L139 ounterexampleChecker]: Examining path program with hash 865009605, occurence #3 [2025-04-14 14:12:29,804 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 14:12:29,805 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 14:12:29,805 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-14 14:12:29,805 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-04-14 14:12:29,805 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 39 [2025-04-14 14:12:29,805 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 57 [2025-04-14 14:12:29,805 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 72 [2025-04-14 14:12:29,805 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 85 [2025-04-14 14:12:29,805 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 98 [2025-04-14 14:12:29,805 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 111 [2025-04-14 14:12:29,805 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 124 [2025-04-14 14:12:29,805 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 137 [2025-04-14 14:12:29,805 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 150 [2025-04-14 14:12:29,805 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,805 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 163 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 176 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 189 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 202 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 215 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 228 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 241 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 254 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 267 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 280 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 293 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 306 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,806 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 319 [2025-04-14 14:12:29,806 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 332 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 345 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 358 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 371 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 384 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 397 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 410 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 423 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 436 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 449 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 462 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 478 [2025-04-14 14:12:29,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 14:12:29,808 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 483 [2025-04-14 14:12:29,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:12:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 937968394, now seen corresponding path program 1 times [2025-04-14 14:12:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 14:12:29,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884812123] [2025-04-14 14:12:29,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:12:29,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:12:30,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-04-14 14:12:30,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-04-14 14:12:30,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:12:30,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:12:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 1875 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:12:31,833 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 14:12:31,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884812123] [2025-04-14 14:12:31,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884812123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:12:31,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:12:31,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2025-04-14 14:12:31,835 INFO L172 ounterexampleChecker]: Successfully proved commutativity at non-minimality point 483. Constructing proof automaton... [2025-04-14 14:12:31,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:12:31,836 INFO L311 artialOrderCegarLoop]: Commutativity proof succeeded, skipping feasibility check. [2025-04-14 14:12:31,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 14:12:31,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SMTINTERPOL [2025-04-14 14:12:31,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 14:12:31,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 14:12:31,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:31,837 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:12:31,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 13.416666666666666) internal successors, (483), 35 states have internal predecessors, (483), 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) [2025-04-14 14:12:31,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:31,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:31,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:31,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:31,837 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:12:31,838 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:34,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:12:34,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:12:34,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-14 14:12:34,374 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:12:34,374 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:12:34,374 INFO L139 ounterexampleChecker]: Examining path program with hash -434770777, occurence #1 [2025-04-14 14:12:34,374 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:12:34,374 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:12:34,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:12:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash 328371569, now seen corresponding path program 1 times [2025-04-14 14:12:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:12:34,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350811891] [2025-04-14 14:12:34,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:12:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:12:34,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-04-14 14:12:38,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-04-14 14:12:38,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:12:38,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:12:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2025-04-14 14:12:41,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:12:41,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350811891] [2025-04-14 14:12:41,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350811891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:12:41,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307265681] [2025-04-14 14:12:41,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:12:41,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:12:41,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:12:41,435 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:12:41,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 14:12:42,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-04-14 14:12:42,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-04-14 14:12:42,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:12:42,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:12:42,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 2877 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-04-14 14:12:42,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:12:44,548 INFO L325 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-04-14 14:12:44,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-14 14:12:44,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:12:44,762 INFO L325 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-04-14 14:12:44,762 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 32 [2025-04-14 14:12:44,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:12:44,817 INFO L354 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 24 treesize of output 17 [2025-04-14 14:12:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:12:44,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:12:45,091 INFO L325 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-04-14 14:12:45,091 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 38 [2025-04-14 14:12:45,096 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:12:45,096 INFO L354 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 51 treesize of output 50 [2025-04-14 14:12:45,105 INFO L354 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 20 treesize of output 18 [2025-04-14 14:12:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:12:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307265681] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:12:47,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:12:47,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 40, 36] total 90 [2025-04-14 14:12:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363750551] [2025-04-14 14:12:47,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:12:47,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2025-04-14 14:12:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:12:47,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2025-04-14 14:12:47,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1243, Invalid=7069, Unknown=60, NotChecked=0, Total=8372 [2025-04-14 14:12:47,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:47,376 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:12:47,376 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 91 states have (on average 10.857142857142858) internal successors, (988), 91 states have internal predecessors, (988), 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) [2025-04-14 14:12:47,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:12:47,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:47,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:47,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:12:47,377 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:13:09,848 WARN L330 ript$VariableManager]: TermVariable v_subst_22 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:10,352 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:11,001 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:22,235 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:22,492 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:27,172 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:27,612 WARN L330 ript$VariableManager]: TermVariable v_subst_25 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:28,191 WARN L330 ript$VariableManager]: TermVariable v_subst_27 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:28,408 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:28,579 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:28,618 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:28,625 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:28,753 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:28,781 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,242 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,259 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,366 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,449 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,460 WARN L330 ript$VariableManager]: TermVariable v_subst_25 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,471 WARN L330 ript$VariableManager]: TermVariable v_subst_27 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,482 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,506 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,674 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,695 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,710 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,924 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:29,958 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:30,096 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:30,138 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:30,588 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:30,691 WARN L330 ript$VariableManager]: TermVariable v_subst_23 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:30,705 WARN L330 ript$VariableManager]: TermVariable v_subst_23 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:30,938 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:31,193 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:31,224 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:31,423 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:31,439 WARN L330 ript$VariableManager]: TermVariable v_subst_30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:31,451 WARN L330 ript$VariableManager]: TermVariable v_subst_23 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:31,488 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:31,670 WARN L330 ript$VariableManager]: TermVariable v_subst_23 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:31,803 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:31,883 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:31,899 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:13:32,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:13:32,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2025-04-14 14:13:32,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 14:13:32,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:13:32,221 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:13:32,222 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:13:32,222 INFO L139 ounterexampleChecker]: Examining path program with hash -1867281391, occurence #1 [2025-04-14 14:13:32,222 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:13:32,222 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:13:32,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:13:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash 931720387, now seen corresponding path program 1 times [2025-04-14 14:13:32,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:13:32,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252968393] [2025-04-14 14:13:32,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:13:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:13:32,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-04-14 14:13:32,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-04-14 14:13:32,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:13:32,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:13:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 1476 trivial. 0 not checked. [2025-04-14 14:13:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:13:33,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252968393] [2025-04-14 14:13:33,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252968393] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:13:33,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405535330] [2025-04-14 14:13:33,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:13:33,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:13:33,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:13:33,992 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:13:33,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 14:13:34,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-04-14 14:13:34,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-04-14 14:13:34,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:13:34,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:13:34,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 2916 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-04-14 14:13:34,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:13:36,287 INFO L325 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-04-14 14:13:36,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-14 14:13:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:13:36,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:13:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 0 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:13:37,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405535330] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:13:37,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:13:37,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 42, 40] total 92 [2025-04-14 14:13:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120031089] [2025-04-14 14:13:37,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:13:37,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2025-04-14 14:13:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:13:37,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2025-04-14 14:13:37,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1531, Invalid=7210, Unknown=1, NotChecked=0, Total=8742 [2025-04-14 14:13:37,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:13:37,707 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:13:37,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 93 states have (on average 10.709677419354838) internal successors, (996), 93 states have internal predecessors, (996), 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) [2025-04-14 14:13:37,707 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:13:37,707 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:13:37,707 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:13:37,707 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:13:37,707 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:13:37,707 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:13:37,707 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:13:37,707 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 248 states. [2025-04-14 14:13:37,708 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:13:54,335 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:13:54,361 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:10,843 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:11,056 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:11,061 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:11,719 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:11,733 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:11,763 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:11,777 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:12,933 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:12,963 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:14,562 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:14,602 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:14,658 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:14,969 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:14,975 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:18,712 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:18,741 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:18,773 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:18,803 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:19,106 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:19,143 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:19,289 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:19,339 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:19,345 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:19,896 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:19,957 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:19,981 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,054 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,073 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,112 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,187 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,265 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,301 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,351 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,387 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,426 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,453 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,464 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,470 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,523 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,538 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,588 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,605 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,631 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,639 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,644 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,746 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,841 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,905 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:20,911 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,040 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,068 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,073 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,136 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,233 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,251 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,289 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,327 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,362 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,449 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,684 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,698 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,721 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,882 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,908 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:21,955 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:22,377 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:22,432 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:22,688 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,102 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,108 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,144 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,156 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,177 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,191 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,583 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,735 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,749 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,780 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,794 WARN L330 ript$VariableManager]: TermVariable v_subst_50 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,887 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,901 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,923 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:23,937 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:24,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:14:24,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2025-04-14 14:14:24,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 360 states. [2025-04-14 14:14:24,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 14:14:24,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:14:24,489 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:14:24,489 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:14:24,489 INFO L139 ounterexampleChecker]: Examining path program with hash -1536892018, occurence #1 [2025-04-14 14:14:24,489 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:14:24,490 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:14:24,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:14:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1997396369, now seen corresponding path program 1 times [2025-04-14 14:14:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:14:24,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003658659] [2025-04-14 14:14:24,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:14:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:14:24,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-04-14 14:14:24,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-04-14 14:14:24,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:14:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:14:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1590 trivial. 0 not checked. [2025-04-14 14:14:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:14:25,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003658659] [2025-04-14 14:14:25,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003658659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:14:25,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:14:25,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 14:14:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697713289] [2025-04-14 14:14:25,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:14:25,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 14:14:25,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:14:25,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 14:14:25,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 14:14:25,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:14:25,618 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:14:25,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 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) [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 248 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 360 states. [2025-04-14 14:14:25,619 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:14:29,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:29,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:14:29,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:29,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:14:29,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:14:29,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:14:29,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2025-04-14 14:14:29,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 360 states. [2025-04-14 14:14:29,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:14:29,871 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-14 14:14:29,871 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:14:29,871 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:14:29,871 INFO L139 ounterexampleChecker]: Examining path program with hash 1655999471, occurence #1 [2025-04-14 14:14:29,871 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:14:29,872 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:14:29,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:14:29,872 INFO L85 PathProgramCache]: Analyzing trace with hash 352589452, now seen corresponding path program 1 times [2025-04-14 14:14:29,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:14:29,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469414967] [2025-04-14 14:14:29,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:14:29,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:14:30,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-04-14 14:14:30,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-04-14 14:14:30,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:14:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:14:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 8 proven. 108 refuted. 0 times theorem prover too weak. 1476 trivial. 0 not checked. [2025-04-14 14:14:31,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:14:31,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469414967] [2025-04-14 14:14:31,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469414967] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:14:31,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859606320] [2025-04-14 14:14:31,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:14:31,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:14:31,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:14:31,134 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:14:31,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 14:14:31,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-04-14 14:14:32,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-04-14 14:14:32,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:14:32,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:14:32,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 3038 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-04-14 14:14:32,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:14:34,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-04-14 14:14:34,356 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-14 14:14:34,356 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-14 14:14:34,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:14:34,411 INFO L354 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 20 treesize of output 15 [2025-04-14 14:14:34,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:14:34,428 INFO L354 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 20 treesize of output 15 [2025-04-14 14:14:34,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:14:34,559 INFO L354 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 [2025-04-14 14:14:34,606 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-04-14 14:14:34,613 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-14 14:14:34,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-14 14:14:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 8 proven. 1584 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:14:34,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:14:35,863 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:14:35,863 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 53 [2025-04-14 14:14:35,866 INFO L354 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 281 treesize of output 253 [2025-04-14 14:14:35,869 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-04-14 14:14:35,871 INFO L354 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 30 treesize of output 26 [2025-04-14 14:14:35,875 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:14:35,875 INFO L354 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 27 treesize of output 31 [2025-04-14 14:14:35,888 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:14:35,888 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 46 [2025-04-14 14:14:35,891 INFO L354 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 388 treesize of output 352 [2025-04-14 14:14:35,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-04-14 14:14:35,900 INFO L354 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 72 treesize of output 66 [2025-04-14 14:14:35,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2025-04-14 14:14:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1592 backedges. 0 proven. 1590 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 14:14:38,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859606320] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:14:38,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:14:38,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 44, 44] total 97 [2025-04-14 14:14:38,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208096530] [2025-04-14 14:14:38,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:14:38,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2025-04-14 14:14:38,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:14:38,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2025-04-14 14:14:38,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=8139, Unknown=59, NotChecked=0, Total=9506 [2025-04-14 14:14:38,750 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:14:38,750 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:14:38,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 10.785714285714286) internal successors, (1057), 97 states have internal predecessors, (1057), 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) [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 248 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 360 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:14:38,751 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:14:59,515 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:14:59,555 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:04,909 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:05,214 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:05,219 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:05,282 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:05,296 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:05,344 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:05,360 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:05,616 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:05,851 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,105 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,201 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,299 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,395 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,409 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,415 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,441 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,463 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,487 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,500 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,507 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,529 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:06,555 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:07,770 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:08,004 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:08,029 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:08,053 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:08,826 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:08,838 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:08,843 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:09,297 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,155 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,169 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,198 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,215 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,239 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,252 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,277 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,390 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,421 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,438 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,541 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,637 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,672 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,695 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,708 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:10,806 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,024 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,345 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,371 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,453 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,479 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,504 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,530 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,654 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,660 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,731 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,757 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,771 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,902 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:11,911 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,075 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,114 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,128 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,150 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,164 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,186 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,245 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,259 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,361 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,423 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,447 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,496 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,521 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,538 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,645 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,671 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,697 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,720 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,743 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,770 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,778 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,832 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,865 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,898 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,926 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,952 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:12,978 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,254 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,282 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,306 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,332 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,360 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,399 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,408 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,412 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,463 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,486 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,513 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,540 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,689 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,718 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,743 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,768 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,794 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,819 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,830 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,872 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,922 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:13,966 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:14,013 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:14,043 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:14,095 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:15,798 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:15,851 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:15,894 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:17,151 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:17,264 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:17,354 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:17,459 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:21,758 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:22,281 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:28,827 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:28,854 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:29,103 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:29,323 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:29,597 WARN L330 ript$VariableManager]: TermVariable v_subst_21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:29,625 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:30,297 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:30,668 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:31,021 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:31,225 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:35,478 WARN L330 ript$VariableManager]: TermVariable v_subst_25 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:35,567 WARN L330 ript$VariableManager]: TermVariable v_subst_25 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:35,790 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:35,812 WARN L330 ript$VariableManager]: TermVariable v_subst_25 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:35,870 WARN L330 ript$VariableManager]: TermVariable v_subst_25 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,052 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,260 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,375 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,477 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,507 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,583 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,589 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,618 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,647 WARN L330 ript$VariableManager]: TermVariable v_subst_27 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,736 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,774 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,903 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:36,963 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:37,036 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:37,270 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:37,425 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:37,450 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:37,480 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:37,527 WARN L330 ript$VariableManager]: TermVariable v_subst_25 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:37,534 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:37,595 WARN L330 ript$VariableManager]: TermVariable v_subst_25 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:39,800 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:39,836 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:39,912 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:40,863 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:40,933 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:41,055 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:41,074 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:41,396 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:41,709 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:41,783 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:41,986 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:45,867 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:46,323 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:46,372 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:46,573 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:46,674 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:46,693 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:46,699 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:47,057 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:47,282 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:47,361 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:47,441 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:47,491 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:47,540 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:48,038 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:48,057 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:48,689 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:48,719 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:49,335 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:49,365 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:49,458 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:49,483 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:50,560 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:50,634 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:50,802 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:51,005 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:51,562 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:51,591 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:51,610 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:51,817 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:51,848 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:51,901 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:51,977 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:52,255 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:52,447 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:52,521 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:52,597 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:52,647 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:52,684 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:52,730 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:53,814 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:56,067 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:56,079 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:15:59,633 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:00,356 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:00,515 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:00,525 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:00,544 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:00,901 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:00,989 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,076 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,093 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,241 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,286 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,333 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,340 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,346 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,351 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,493 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,594 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,622 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,671 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,688 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,752 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,952 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:01,990 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,027 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,112 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,121 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,147 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,322 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,349 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,371 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,390 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,639 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,651 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,657 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,672 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,794 WARN L330 ript$VariableManager]: TermVariable v_subst_80 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,837 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,909 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,919 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:02,924 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,005 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,012 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,100 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,111 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,150 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,213 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,280 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,356 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,386 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,415 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,441 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,525 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:05,552 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:06,005 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:06,082 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:07,794 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:07,834 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:07,858 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:07,914 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:07,990 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,051 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,057 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,124 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,130 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,152 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,200 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,274 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,605 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,646 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,680 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,686 WARN L330 ript$VariableManager]: TermVariable |thr1Thread2of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:08,723 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:09,114 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:09,269 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:09,320 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:09,444 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:09,843 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:10,778 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:10,832 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:11,422 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:11,449 WARN L330 ript$VariableManager]: TermVariable v_subst_79 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:12,499 WARN L330 ript$VariableManager]: TermVariable v_subst_81 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:12,633 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:12,746 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:12,838 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:12,924 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:12,962 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:12,979 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:12,987 WARN L330 ript$VariableManager]: TermVariable v_subst_67 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:12,993 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:12,999 WARN L330 ript$VariableManager]: TermVariable v_subst_70 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:13,319 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:13,416 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:13,532 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:13,641 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:13,670 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:13,706 WARN L330 ript$VariableManager]: TermVariable v_subst_68 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:13,766 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:13,871 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:16:14,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 320 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 389 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:16:14,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2025-04-14 14:16:14,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 14:16:14,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-14 14:16:14,291 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:16:14,291 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:16:14,291 INFO L139 ounterexampleChecker]: Examining path program with hash 1501590231, occurence #1 [2025-04-14 14:16:14,292 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:16:14,292 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:16:14,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:16:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1123607851, now seen corresponding path program 1 times [2025-04-14 14:16:14,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:16:14,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979116289] [2025-04-14 14:16:14,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:16:14,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:16:14,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-04-14 14:16:14,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-04-14 14:16:14,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:16:14,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:16:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1576 backedges. 10 proven. 202 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2025-04-14 14:16:16,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:16:16,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979116289] [2025-04-14 14:16:16,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979116289] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:16:16,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34177057] [2025-04-14 14:16:16,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:16:16,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:16:16,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:16:16,008 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:16:16,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 14:16:16,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-04-14 14:16:17,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-04-14 14:16:17,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:16:17,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:16:17,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 3034 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-04-14 14:16:17,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:16:18,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-14 14:16:18,379 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-04-14 14:16:18,386 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-14 14:16:18,387 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-14 14:16:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1576 backedges. 0 proven. 1566 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 14:16:18,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:16:18,724 INFO L325 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2025-04-14 14:16:18,724 INFO L354 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 4 case distinctions, treesize of input 45 treesize of output 60 [2025-04-14 14:16:18,737 INFO L325 Elim1Store]: treesize reduction 22, result has 45.0 percent of original size [2025-04-14 14:16:18,737 INFO L354 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 64 [2025-04-14 14:16:18,749 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-04-14 14:16:18,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-04-14 14:16:18,777 INFO L325 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2025-04-14 14:16:18,777 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 35 [2025-04-14 14:16:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1576 backedges. 0 proven. 1566 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 14:16:20,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34177057] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:16:20,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:16:20,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 41, 40] total 94 [2025-04-14 14:16:20,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418717143] [2025-04-14 14:16:20,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:16:20,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2025-04-14 14:16:20,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:16:20,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2025-04-14 14:16:20,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1384, Invalid=7546, Unknown=0, NotChecked=0, Total=8930 [2025-04-14 14:16:20,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:16:20,930 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:16:20,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 11.042105263157895) internal successors, (1049), 94 states have internal predecessors, (1049), 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) [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:16:20,930 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:16:20,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:16:20,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:16:20,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:16:20,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:16:20,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:16:20,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 320 states. [2025-04-14 14:16:20,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 389 states. [2025-04-14 14:16:20,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:16:20,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 196 states. [2025-04-14 14:16:20,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:16:35,290 WARN L330 ript$VariableManager]: TermVariable v_subst_84 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:35,290 WARN L330 ript$VariableManager]: TermVariable v_subst_83 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:35,887 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:36,499 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:48,149 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:48,180 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:48,471 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:48,514 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:48,948 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,023 WARN L330 ript$VariableManager]: TermVariable v_subst_85 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,036 WARN L330 ript$VariableManager]: TermVariable v_subst_85 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,316 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,328 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,342 WARN L330 ript$VariableManager]: TermVariable v_subst_85 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,348 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,385 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,472 WARN L330 ript$VariableManager]: TermVariable v_subst_85 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,560 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,573 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,635 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,654 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,687 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,706 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,881 WARN L330 ript$VariableManager]: TermVariable v_subst_84 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,881 WARN L330 ript$VariableManager]: TermVariable v_subst_83 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:49,891 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:52,883 WARN L330 ript$VariableManager]: TermVariable v_subst_84 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:52,884 WARN L330 ript$VariableManager]: TermVariable v_subst_83 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:52,943 WARN L330 ript$VariableManager]: TermVariable v_subst_84 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:52,944 WARN L330 ript$VariableManager]: TermVariable v_subst_83 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:54,487 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:54,487 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:54,683 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:54,684 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:55,401 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:55,438 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:55,482 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:55,515 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:55,528 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:55,579 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:55,579 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:56,468 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:56,468 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:57,371 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:57,385 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:57,416 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:57,529 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:57,589 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:57,589 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:57,725 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,244 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,572 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,573 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,599 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,625 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,651 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,716 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,810 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,854 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,858 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,880 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,893 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,920 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,943 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,956 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:58,983 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,001 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,290 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,304 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,401 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,402 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,444 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,444 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,465 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,465 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,810 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,824 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,852 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,876 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,903 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,926 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,932 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,960 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,960 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,984 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:16:59,998 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,021 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,371 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,371 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,390 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,419 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,456 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,457 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,629 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,629 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,636 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,655 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,655 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,910 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,910 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,936 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,962 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,968 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:00,990 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:01,016 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:01,066 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:01,933 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:01,933 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,081 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,345 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,346 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,499 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,522 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,550 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,576 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,602 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,602 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,739 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,872 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,881 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:02,924 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,020 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,020 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,046 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,110 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,169 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,197 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,197 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,255 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,413 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,435 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,436 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,476 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,477 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,525 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,525 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,609 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,609 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,651 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:03,652 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:04,012 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:04,200 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:04,200 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:04,328 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:04,329 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:04,485 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:04,485 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:05,474 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:05,474 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:05,500 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:05,526 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:05,552 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:05,723 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:05,995 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,029 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,061 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,061 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,289 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,304 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,319 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,332 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,342 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,378 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,419 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,437 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,437 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,443 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,474 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,474 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,554 WARN L330 ript$VariableManager]: TermVariable v_subst_89 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,555 WARN L330 ript$VariableManager]: TermVariable v_subst_88 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:06,988 WARN L330 ript$VariableManager]: TermVariable v_subst_78 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:07,213 WARN L330 ript$VariableManager]: TermVariable v_subst_76 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:07,293 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:07,303 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:07,344 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:07,360 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,274 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,280 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,299 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,305 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,335 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,341 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,385 WARN L330 ript$VariableManager]: TermVariable v_subst_25 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,399 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,407 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,418 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,437 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,456 WARN L330 ript$VariableManager]: TermVariable v_subst_25 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,483 WARN L330 ript$VariableManager]: TermVariable v_subst_27 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,499 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,514 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:08,552 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,210 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,216 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,254 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,260 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,304 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,323 WARN L330 ript$VariableManager]: TermVariable v_subst_24 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,379 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,386 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,427 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,433 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,444 WARN L330 ript$VariableManager]: TermVariable v_subst_86 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,480 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,488 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,493 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,504 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:09,509 WARN L330 ript$VariableManager]: TermVariable |thr1Thread3of3ForFork0_push_~#casret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:17:10,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:10,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:17:10,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:17:10,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:17:10,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 320 states. [2025-04-14 14:17:10,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 389 states. [2025-04-14 14:17:10,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:17:10,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2025-04-14 14:17:10,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2025-04-14 14:17:10,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 14:17:10,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-14 14:17:10,696 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:17:10,696 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:17:10,696 INFO L139 ounterexampleChecker]: Examining path program with hash -2039775533, occurence #1 [2025-04-14 14:17:10,696 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:17:10,696 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:17:10,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:17:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash -373276132, now seen corresponding path program 1 times [2025-04-14 14:17:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:17:10,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339428882] [2025-04-14 14:17:10,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 14:17:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:17:10,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-04-14 14:17:11,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-04-14 14:17:11,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 14:17:11,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:17:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1579 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2025-04-14 14:17:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:17:12,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339428882] [2025-04-14 14:17:12,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339428882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 14:17:12,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 14:17:12,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 14:17:12,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519817671] [2025-04-14 14:17:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 14:17:12,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 14:17:12,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:17:12,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 14:17:12,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 14:17:12,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:17:12,437 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:17:12,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 6 states have internal predecessors, (109), 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) [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 320 states. [2025-04-14 14:17:12,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 389 states. [2025-04-14 14:17:12,438 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:17:12,438 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 196 states. [2025-04-14 14:17:12,438 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 223 states. [2025-04-14 14:17:12,438 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:17:21,925 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:21,974 WARN L330 ript$VariableManager]: TermVariable v_subst_73 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:23,171 WARN L330 ript$VariableManager]: TermVariable v_subst_91 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:23,171 WARN L330 ript$VariableManager]: TermVariable v_subst_90 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 320 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 389 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2025-04-14 14:17:23,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2025-04-14 14:17:23,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:17:23,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-14 14:17:23,785 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 14:17:23,785 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 14:17:23,785 INFO L139 ounterexampleChecker]: Examining path program with hash -1151930950, occurence #1 [2025-04-14 14:17:23,785 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 14:17:23,785 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 14:17:23,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 14:17:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash 56559196, now seen corresponding path program 2 times [2025-04-14 14:17:23,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 14:17:23,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566435658] [2025-04-14 14:17:23,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:17:23,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 14:17:23,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 516 statements into 2 equivalence classes. [2025-04-14 14:17:24,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 146 of 516 statements. [2025-04-14 14:17:24,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 14:17:24,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:17:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2025-04-14 14:17:24,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 14:17:24,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566435658] [2025-04-14 14:17:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566435658] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 14:17:24,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520635790] [2025-04-14 14:17:24,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 14:17:24,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 14:17:24,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 14:17:24,670 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 14:17:24,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 14:17:25,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 516 statements into 2 equivalence classes. [2025-04-14 14:17:25,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 146 of 516 statements. [2025-04-14 14:17:25,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 14:17:25,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 14:17:25,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-04-14 14:17:25,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 14:17:27,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-04-14 14:17:27,354 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-14 14:17:27,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-14 14:17:27,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-14 14:17:27,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:17:27,428 INFO L354 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 20 treesize of output 15 [2025-04-14 14:17:27,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:17:27,465 INFO L354 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 20 treesize of output 15 [2025-04-14 14:17:27,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:17:27,560 INFO L354 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 [2025-04-14 14:17:27,575 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2025-04-14 14:17:27,591 INFO L325 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2025-04-14 14:17:27,591 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 63 [2025-04-14 14:17:27,608 INFO L325 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-04-14 14:17:27,608 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 22 [2025-04-14 14:17:27,616 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-14 14:17:27,639 INFO L325 Elim1Store]: treesize reduction 21, result has 12.5 percent of original size [2025-04-14 14:17:27,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2025-04-14 14:17:27,648 INFO L354 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 15 [2025-04-14 14:17:27,654 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:17:27,654 INFO L354 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 15 treesize of output 19 [2025-04-14 14:17:27,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:17:27,929 INFO L325 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2025-04-14 14:17:27,930 INFO L354 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 5 case distinctions, treesize of input 91 treesize of output 102 [2025-04-14 14:17:27,936 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:17:27,936 INFO L354 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 51 treesize of output 56 [2025-04-14 14:17:27,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-14 14:17:28,022 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 14:17:28,023 INFO L354 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 43 treesize of output 39 [2025-04-14 14:17:28,570 INFO L325 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-04-14 14:17:28,570 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 52 [2025-04-14 14:17:28,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:17:28,595 INFO L325 Elim1Store]: treesize reduction 83, result has 7.8 percent of original size [2025-04-14 14:17:28,595 INFO L354 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 3 case distinctions, treesize of input 93 treesize of output 52 [2025-04-14 14:17:28,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:17:28,883 INFO L325 Elim1Store]: treesize reduction 155, result has 22.5 percent of original size [2025-04-14 14:17:28,883 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 146 [2025-04-14 14:17:29,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:17:29,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:17:29,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:17:29,197 INFO L325 Elim1Store]: treesize reduction 104, result has 36.6 percent of original size [2025-04-14 14:17:29,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 170 treesize of output 192 [2025-04-14 14:17:29,208 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:17:29,209 INFO L354 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 103 treesize of output 108 [2025-04-14 14:17:29,213 INFO L354 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 99 treesize of output 97 [2025-04-14 14:17:29,222 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:17:29,222 INFO L354 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 97 treesize of output 102 [2025-04-14 14:17:29,422 INFO L354 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 15 treesize of output 11 [2025-04-14 14:17:29,457 INFO L354 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 15 treesize of output 11 [2025-04-14 14:17:29,466 INFO L354 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 15 treesize of output 11 [2025-04-14 14:17:29,482 INFO L354 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 15 treesize of output 11 [2025-04-14 14:17:29,489 INFO L354 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 15 treesize of output 11 [2025-04-14 14:17:29,539 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 14:17:29,542 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 14:17:29,639 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 14:17:29,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 14:17:29,646 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-14 14:17:29,655 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-14 14:17:29,668 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 14:17:29,668 INFO L354 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 20 treesize of output 1 [2025-04-14 14:17:30,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:17:30,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:17:30,262 INFO L325 Elim1Store]: treesize reduction 308, result has 28.0 percent of original size [2025-04-14 14:17:30,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 42 case distinctions, treesize of input 244 treesize of output 310 [2025-04-14 14:17:30,270 INFO L354 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 199 treesize of output 197 [2025-04-14 14:17:30,275 INFO L354 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 197 treesize of output 195 [2025-04-14 14:17:30,418 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:17:30,419 INFO L354 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 195 treesize of output 200 [2025-04-14 14:17:30,425 INFO L354 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 191 treesize of output 189 [2025-04-14 14:17:56,375 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-14 14:17:56,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-14 14:17:56,623 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-14 14:17:57,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-14 14:17:57,353 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-14 14:18:14,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:18:14,791 INFO L354 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 28 treesize of output 21 [2025-04-14 14:18:14,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:18:14,849 INFO L354 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 28 treesize of output 21 [2025-04-14 14:18:14,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 14:18:14,869 INFO L354 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 28 treesize of output 21 [2025-04-14 14:18:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 90 proven. 14 refuted. 0 times theorem prover too weak. 1478 trivial. 0 not checked. [2025-04-14 14:18:14,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 14:18:15,371 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse2 (select .cse7 |c_~#top~0.offset|))) (let ((.cse3 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| .cse2))) (and (or (forall ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_20))) (let ((.cse1 (select .cse0 |c_~#top~0.base|))) (or (not (= (select (select (store (store (store .cse0 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (< v_ArrVal_16192 |c_thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= .cse2 (select .cse1 |c_~#top~0.offset|))))))) .cse3) (let ((.cse6 (store |c_#memory_int| |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse5 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base|))) (or (not (= (select .cse4 |c_~#top~0.offset|) .cse2)) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (v_ArrVal_16200 (Array Int Int))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (< v_ArrVal_16192 |c_thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (not .cse3))))))))) is different from false [2025-04-14 14:18:16,086 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse6 (= (select .cse14 |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) (and (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21))) (let ((.cse4 (store .cse2 |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (= (select (select .cse2 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))))))))) .cse6) (or (not .cse6) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse13 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (store (store |c_#memory_int| |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| v_ArrVal_16184)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13))) (let ((.cse9 (store .cse11 |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse8 (select .cse9 |c_~#top~0.base|))) (let ((.cse12 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse10 (store (select .cse12 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse7 (select (store .cse12 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse10) |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) (select .cse8 |c_~#top~0.offset|))) (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse9 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse10) |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse11 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1)))))))))))))) is different from false [2025-04-14 14:18:16,158 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse2 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)))) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse6 (select .cse11 |c_~#top~0.base|))) (or (not (= (select .cse6 |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse12 (store .cse6 |c_~#top~0.offset| v_ArrVal_16184)) (.cse13 (store (select (store .cse11 |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse10 (select .cse7 |c_~#top~0.base|))) (let ((.cse14 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse8 (store (select .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse7 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse10 |c_~#top~0.offset|) (select .cse9 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse11 |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))))) is different from false [2025-04-14 14:18:16,354 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|))) (and (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse0 (select .cse6 |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) .cse1)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#top~0.offset| v_ArrVal_16184)) (.cse8 (store (select (store .cse6 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse5 (select .cse2 |c_~#top~0.base|))) (let ((.cse9 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse2 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse5 |c_~#top~0.offset|) (select .cse4 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse6 |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse14 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse14 |c_~#top~0.base|))) (let ((.cse15 (store .cse14 |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse12 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base|))) (or (not (= (select .cse10 |c_~#top~0.offset|) (select .cse11 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse13 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse14 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|) .cse1)))))) is different from false [2025-04-14 14:18:16,768 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse2 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse6 (select .cse11 |c_~#top~0.base|))) (or (not (= (select .cse6 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse12 (store .cse6 |c_~#top~0.offset| v_ArrVal_16184)) (.cse13 (store (select (store .cse11 |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse10 (select .cse7 |c_~#top~0.base|))) (let ((.cse14 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse8 (store (select .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse7 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse10 |c_~#top~0.offset|) (select .cse9 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse11 |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))))) is different from false [2025-04-14 14:18:18,380 INFO L325 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2025-04-14 14:18:18,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 193669 treesize of output 181901 [2025-04-14 14:18:18,498 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:18:18,498 INFO L354 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 4222 treesize of output 4126 [2025-04-14 14:18:18,581 INFO L354 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 2178 treesize of output 2130 [2025-04-14 14:18:18,641 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:18:18,642 INFO L354 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 1038 treesize of output 1002 [2025-04-14 14:18:18,686 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:18:18,686 INFO L354 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 1596 treesize of output 1536 [2025-04-14 14:18:18,781 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 14:18:18,781 INFO L354 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 399 treesize of output 387 [2025-04-14 14:18:18,863 INFO L354 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 30 treesize of output 26 [2025-04-14 14:18:18,902 INFO L354 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 374 treesize of output 354 [2025-04-14 14:18:19,414 INFO L354 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 662 treesize of output 654 [2025-04-14 14:18:19,743 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 14:18:19,747 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 14:18:19,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1765 treesize of output 1 [2025-04-14 14:18:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1582 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1496 trivial. 5 not checked. [2025-04-14 14:18:20,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520635790] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 14:18:20,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 14:18:20,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27, 26] total 65 [2025-04-14 14:18:20,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346677400] [2025-04-14 14:18:20,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 14:18:20,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-14 14:18:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 14:18:20,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-14 14:18:20,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=3175, Unknown=55, NotChecked=610, Total=4290 [2025-04-14 14:18:20,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:18:20,317 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 14:18:20,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 5.818181818181818) internal successors, (384), 65 states have internal predecessors, (384), 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) [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2025-04-14 14:18:20,317 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 14:18:20,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 320 states. [2025-04-14 14:18:20,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 389 states. [2025-04-14 14:18:20,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:18:20,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 196 states. [2025-04-14 14:18:20,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 224 states. [2025-04-14 14:18:20,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 14:18:20,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 14:18:23,967 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse2 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (= |c_thr1Thread3of3ForFork0_push_loop_~r~0#1| 0) (not (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse6 (select .cse11 |c_~#top~0.base|))) (or (not (= (select .cse6 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse12 (store .cse6 |c_~#top~0.offset| v_ArrVal_16184)) (.cse13 (store (select (store .cse11 |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse10 (select .cse7 |c_~#top~0.base|))) (let ((.cse14 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse8 (store (select .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse7 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse10 |c_~#top~0.offset|) (select .cse9 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse11 |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))))) is different from false [2025-04-14 14:18:24,267 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|))) (and (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse0 (select .cse6 |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) .cse1)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#top~0.offset| v_ArrVal_16184)) (.cse8 (store (select (store .cse6 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse5 (select .cse2 |c_~#top~0.base|))) (let ((.cse9 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse2 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse5 |c_~#top~0.offset|) (select .cse4 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse6 |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse14 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse14 |c_~#top~0.base|))) (let ((.cse15 (store .cse14 |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse12 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base|))) (or (not (= (select .cse10 |c_~#top~0.offset|) (select .cse11 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse13 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse14 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|) .cse1)))) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|))) is different from false [2025-04-14 14:19:15,044 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse6 (not (= (select .cse7 |c_~#top~0.offset|) 0)))) (and (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse2 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (= |c_thr1Thread3of3ForFork0_push_loop_~r~0#1| 0) .cse6) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (or (= |c_thr1Thread3of3ForFork0_push_#res#1| 0) .cse6) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse7 0)) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse8 (select .cse13 |c_~#top~0.base|))) (or (not (= (select .cse8 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse14 (store .cse8 |c_~#top~0.offset| v_ArrVal_16184)) (.cse15 (store (select (store .cse13 |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse14) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse12 (select .cse9 |c_~#top~0.base|))) (let ((.cse16 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse10 (store (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (select (store .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse10) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse9 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse10) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse12 |c_~#top~0.offset|) (select .cse11 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse13 |c_~#top~0.base| .cse14) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))))))) is different from false [2025-04-14 14:19:15,578 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (not (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (and (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse2 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (= |c_thr1Thread3of3ForFork0_push_loop_~r~0#1| 0) .cse6) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (or (= |c_thr1Thread3of3ForFork0_push_#res#1| 0) .cse6) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse7 (select .cse12 |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse13 (store .cse7 |c_~#top~0.offset| v_ArrVal_16184)) (.cse14 (store (select (store .cse12 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse8 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse8 |c_~#top~0.base|))) (let ((.cse15 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse9 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse8 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse11 |c_~#top~0.offset|) (select .cse10 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse12 |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:19:18,353 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse2 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (or (= |c_thr1Thread3of3ForFork0_push_#res#1| 0) (not (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse6 (select .cse11 |c_~#top~0.base|))) (or (not (= (select .cse6 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse12 (store .cse6 |c_~#top~0.offset| v_ArrVal_16184)) (.cse13 (store (select (store .cse11 |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse10 (select .cse7 |c_~#top~0.base|))) (let ((.cse14 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse8 (store (select .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse7 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse10 |c_~#top~0.offset|) (select .cse9 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse11 |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))))) is different from false [2025-04-14 14:19:32,336 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#top~0.base|))) (and (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse2 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (= |c_thr1Thread3of3ForFork0_push_loop_~r~0#1| 0) (not (= (select .cse6 |c_~#top~0.offset|) 0))) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse6 0)) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse7 (select .cse12 |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse13 (store .cse7 |c_~#top~0.offset| v_ArrVal_16184)) (.cse14 (store (select (store .cse12 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse8 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse8 |c_~#top~0.base|))) (let ((.cse15 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse9 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse8 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse11 |c_~#top~0.offset|) (select .cse10 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse12 |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:19:45,515 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse2 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) 0)) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse6 (select .cse11 |c_~#top~0.base|))) (or (not (= (select .cse6 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse12 (store .cse6 |c_~#top~0.offset| v_ArrVal_16184)) (.cse13 (store (select (store .cse11 |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse10 (select .cse7 |c_~#top~0.base|))) (let ((.cse14 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse8 (store (select .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse7 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse10 |c_~#top~0.offset|) (select .cse9 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse11 |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))))) is different from false [2025-04-14 14:19:45,974 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#top~0.base|))) (and (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse2 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (or (= |c_thr1Thread3of3ForFork0_push_#res#1| 0) (not (= (select .cse6 |c_~#top~0.offset|) 0))) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse6 0)) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse7 (select .cse12 |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse13 (store .cse7 |c_~#top~0.offset| v_ArrVal_16184)) (.cse14 (store (select (store .cse12 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse8 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse8 |c_~#top~0.base|))) (let ((.cse15 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse9 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse8 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse11 |c_~#top~0.offset|) (select .cse10 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse12 |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:20:17,253 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse1 (select .cse19 |c_~#top~0.offset|)) (.cse18 (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (.cse17 (= |c_thr1Thread3of3ForFork0_push_#t~mem9#1| 1)) (.cse16 (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse0 (select .cse6 |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) .cse1)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#top~0.offset| v_ArrVal_16184)) (.cse8 (store (select (store .cse6 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse5 (select .cse2 |c_~#top~0.base|))) (let ((.cse9 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse2 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse5 |c_~#top~0.offset|) (select .cse4 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse6 |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse14 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse14 |c_~#top~0.base|))) (let ((.cse15 (store .cse14 |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse12 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base|))) (or (not (= (select .cse10 |c_~#top~0.offset|) (select .cse11 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse13 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse14 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|) .cse1)))) (or .cse16 .cse17) (or (not .cse16) (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) .cse18) (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse19 0)) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|) (or .cse18 .cse17) (or .cse16 (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))))) is different from false [2025-04-14 14:21:58,715 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse1 (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|))) (and (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse0 (select .cse6 |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) .cse1)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#top~0.offset| v_ArrVal_16184)) (.cse8 (store (select (store .cse6 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse5 (select .cse2 |c_~#top~0.base|))) (let ((.cse9 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse2 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse5 |c_~#top~0.offset|) (select .cse4 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse6 |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) .cse10 (= |c_~#top~0.offset| 0) (or (and .cse10 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (<= |c_~#m~0.base| 3) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse15 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse12 (select .cse15 |c_~#top~0.base|))) (let ((.cse16 (store .cse15 |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse13 (store (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (select (store .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base|))) (or (not (= (select .cse11 |c_~#top~0.offset|) (select .cse12 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse14 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse15 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse1)))) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (or (not (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (forall ((v_ArrVal_16200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (<= 4 |c_~#top~0.base|) (= .cse1 |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) is different from false [2025-04-14 14:21:58,741 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse1 (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|))) (and (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse0 (select .cse6 |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) .cse1)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#top~0.offset| v_ArrVal_16184)) (.cse8 (store (select (store .cse6 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse5 (select .cse2 |c_~#top~0.base|))) (let ((.cse9 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse2 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse5 |c_~#top~0.offset|) (select .cse4 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse6 |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) .cse10 (or (and .cse10 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse15 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse12 (select .cse15 |c_~#top~0.base|))) (let ((.cse16 (store .cse15 |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse13 (store (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (select (store .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base|))) (or (not (= (select .cse11 |c_~#top~0.offset|) (select .cse12 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse14 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse15 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse1)))) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|))) is different from false [2025-04-14 14:22:00,262 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|)))) (and .cse0 (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (= |c_thr1Thread3of3ForFork0_push_loop_~r~0#1| 0) (not (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse7 (select .cse12 |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse13 (store .cse7 |c_~#top~0.offset| v_ArrVal_16184)) (.cse14 (store (select (store .cse12 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse8 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse8 |c_~#top~0.base|))) (let ((.cse15 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse9 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse8 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse11 |c_~#top~0.offset|) (select .cse10 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse12 |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:22:02,525 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse7 (not (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (and .cse0 (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (= |c_thr1Thread3of3ForFork0_push_loop_~r~0#1| 0) .cse7) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (or (= |c_thr1Thread3of3ForFork0_push_#res#1| 0) .cse7) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse8 (select .cse13 |c_~#top~0.base|))) (or (not (= (select .cse8 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse14 (store .cse8 |c_~#top~0.offset| v_ArrVal_16184)) (.cse15 (store (select (store .cse13 |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse14) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse12 (select .cse9 |c_~#top~0.base|))) (let ((.cse16 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse10 (store (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (select (store .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse10) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse9 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse10) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse12 |c_~#top~0.offset|) (select .cse11 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse13 |c_~#top~0.base| .cse14) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:22:04,727 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|)))) (and .cse0 (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse7 (select .cse12 |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse13 (store .cse7 |c_~#top~0.offset| v_ArrVal_16184)) (.cse14 (store (select (store .cse12 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse8 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse8 |c_~#top~0.base|))) (let ((.cse15 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse9 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse8 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse11 |c_~#top~0.offset|) (select .cse10 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse12 |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:22:08,163 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse9 (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (.cse8 (= |c_thr1Thread3of3ForFork0_push_#t~mem9#1| 1)) (.cse7 (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|)) (.cse10 (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))) (and .cse0 (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (or .cse7 .cse8) (or (not .cse7) (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) .cse9) (let ((.cse12 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse14 (store |c_#memory_int| |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse13 (store (select .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (select (store .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base|))) (or .cse10 (not (= (select .cse11 |c_~#top~0.offset|) (select .cse12 |c_~#top~0.offset|))) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (v_ArrVal_16200 (Array Int Int))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (< v_ArrVal_16192 |c_thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| v_ArrVal_16192)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (or .cse9 .cse8) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse15 (select .cse20 |c_~#top~0.base|))) (or (not (= (select .cse15 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse21 (store .cse15 |c_~#top~0.offset| v_ArrVal_16184)) (.cse22 (store (select (store .cse20 |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse16 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse21) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse22) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse19 (select .cse16 |c_~#top~0.base|))) (let ((.cse23 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse22) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse19 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse17 (store (select .cse23 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse18 (select (store .cse23 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse17) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse16 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse17) |c_~#top~0.base| (store .cse18 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse19 |c_~#top~0.offset|) (select .cse18 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse20 |c_~#top~0.base| .cse21) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse22) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) (or .cse7 .cse10))) is different from false [2025-04-14 14:22:08,431 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse1 (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)) (.cse17 (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse0 (select .cse6 |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) .cse1)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#top~0.offset| v_ArrVal_16184)) (.cse8 (store (select (store .cse6 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse5 (select .cse2 |c_~#top~0.base|))) (let ((.cse9 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse2 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse5 |c_~#top~0.offset|) (select .cse4 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse6 |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) .cse10 (or (and .cse10 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse15 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse12 (select .cse15 |c_~#top~0.base|))) (let ((.cse16 (store .cse15 |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse13 (store (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (select (store .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base|))) (or (not (= (select .cse11 |c_~#top~0.offset|) (select .cse12 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse14 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse15 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse1)))) (or (not .cse17) (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (or .cse17 (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))) is different from false [2025-04-14 14:22:15,868 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse10 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse1 (select .cse20 |c_~#top~0.offset|))) (and (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse0 (select .cse6 |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) .cse1)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#top~0.offset| v_ArrVal_16184)) (.cse8 (store (select (store .cse6 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse5 (select .cse2 |c_~#top~0.base|))) (let ((.cse9 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse2 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse5 |c_~#top~0.offset|) (select .cse4 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse6 |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) .cse10 (or (and .cse10 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse15 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse12 (select .cse15 |c_~#top~0.base|))) (let ((.cse16 (store .cse15 |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse13 (store (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (select (store .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base|))) (or (not (= (select .cse11 |c_~#top~0.offset|) (select .cse12 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse14 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse15 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse1)))) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (or (not (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (forall ((v_ArrVal_16200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (let ((.cse19 (store |c_#memory_int| |c_~#top~0.base| (store .cse20 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse18 (store (select .cse19 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse17 (select (store .cse19 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#top~0.base|))) (or (not (= (select .cse17 |c_~#top~0.offset|) .cse1)) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (v_ArrVal_16200 (Array Int Int))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (< v_ArrVal_16192 |c_thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| v_ArrVal_16192)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (= |c_thr1Thread3of3ForFork0_push_#t~mem9#1| 1)))))))) is different from false [2025-04-14 14:22:19,115 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|)))) (and (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) .cse0 (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (or (not (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (forall ((v_ArrVal_16200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (let ((.cse8 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse10 (store |c_#memory_int| |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse9 (store (select .cse10 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse7 (select (store .cse10 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) (select .cse8 |c_~#top~0.offset|))) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (v_ArrVal_16200 (Array Int Int))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (< v_ArrVal_16192 |c_thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| v_ArrVal_16192)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse11 (select .cse16 |c_~#top~0.base|))) (or (not (= (select .cse11 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse17 (store .cse11 |c_~#top~0.offset| v_ArrVal_16184)) (.cse18 (store (select (store .cse16 |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse12 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse17) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse15 (select .cse12 |c_~#top~0.base|))) (let ((.cse19 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse13 (store (select .cse19 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse14 (select (store .cse19 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse12 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse15 |c_~#top~0.offset|) (select .cse14 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse16 |c_~#top~0.base| .cse17) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse18) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:22:19,555 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|)))) (and .cse0 (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)))) (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse7 (select .cse12 |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse13 (store .cse7 |c_~#top~0.offset| v_ArrVal_16184)) (.cse14 (store (select (store .cse12 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse8 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse8 |c_~#top~0.base|))) (let ((.cse15 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse9 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse8 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse11 |c_~#top~0.offset|) (select .cse10 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse12 |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:22:19,725 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse7 (= (select .cse15 |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) (and .cse0 (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21))) (let ((.cse5 (store .cse3 |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse4 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse4) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (= (select (select .cse3 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse4) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))))))))) .cse7) (or (not .cse7) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse14 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse12 (store (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| v_ArrVal_16184)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14))) (let ((.cse10 (store .cse12 |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse9 (select .cse10 |c_~#top~0.base|))) (let ((.cse13 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse11 (store (select .cse13 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store .cse13 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse11) |c_~#top~0.base|))) (or (not (= (select .cse8 |c_~#top~0.offset|) (select .cse9 |c_~#top~0.offset|))) (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse10 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse11) |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse12 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1))))))))))) .cse7))) is different from false [2025-04-14 14:22:37,406 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse17 (select .cse15 |c_~#top~0.offset|))) (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse7 (= .cse17 |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) (and (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) .cse0 (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21))) (let ((.cse5 (store .cse3 |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse4 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse4) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (= (select (select .cse3 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse4) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))))))))) .cse7) (or (not .cse7) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse14 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse12 (store (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| v_ArrVal_16184)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14))) (let ((.cse10 (store .cse12 |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse9 (select .cse10 |c_~#top~0.base|))) (let ((.cse13 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse11 (store (select .cse13 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store .cse13 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse11) |c_~#top~0.base|))) (or (not (= (select .cse8 |c_~#top~0.offset|) (select .cse9 |c_~#top~0.offset|))) (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse10 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse11) |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse12 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1))))))))))) (let ((.cse19 (store |c_#memory_int| |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse18 (store (select .cse19 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse16 (select (store .cse19 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#top~0.base|))) (or (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select .cse16 |c_~#top~0.offset|) .cse17)) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (v_ArrVal_16200 (Array Int Int))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (< v_ArrVal_16192 |c_thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse18) |c_~#top~0.base| (store .cse16 |c_~#top~0.offset| v_ArrVal_16192)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) .cse7)))) is different from false [2025-04-14 14:22:37,434 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse7 (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|))) (and .cse0 (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (or (not .cse7) (= (select (select |c_#memory_int| |c_~#m~0.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|)) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse8 (select .cse13 |c_~#top~0.base|))) (or (not (= (select .cse8 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse14 (store .cse8 |c_~#top~0.offset| v_ArrVal_16184)) (.cse15 (store (select (store .cse13 |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse14) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse12 (select .cse9 |c_~#top~0.base|))) (let ((.cse16 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse10 (store (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (select (store .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse10) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse9 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse10) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse12 |c_~#top~0.offset|) (select .cse11 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse13 |c_~#top~0.base| .cse14) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) (or .cse7 (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))) is different from false [2025-04-14 14:22:44,186 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|)))) (and .cse0 (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (or (= |c_thr1Thread3of3ForFork0_push_#res#1| 0) (not (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse7 (select .cse12 |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse13 (store .cse7 |c_~#top~0.offset| v_ArrVal_16184)) (.cse14 (store (select (store .cse12 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse8 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse8 |c_~#top~0.base|))) (let ((.cse15 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse9 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse8 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse11 |c_~#top~0.offset|) (select .cse10 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse12 |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:22:58,664 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse11 (select .cse14 |c_~#top~0.offset|))) (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse3 (forall ((v_ArrVal_16200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (.cse2 (not (= |c_thr1Thread3of3ForFork0_push_#t~mem9#1| 1))) (.cse1 (not (= .cse11 0)))) (and (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) .cse0 (or (= |c_thr1Thread3of3ForFork0_push_loop_~r~0#1| 0) .cse1) (= |c_~#top~0.offset| 0) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (<= |c_~#m~0.base| 3) (or (= |c_thr1Thread3of3ForFork0_push_#res#1| 0) .cse1) (or .cse2 .cse3) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (or (not (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) .cse3) (or .cse2 .cse1) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse8 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse5 (select .cse8 |c_~#top~0.base|))) (let ((.cse9 (store .cse8 |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse6 (store (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse6) |c_~#top~0.base|))) (or (not (= (select .cse4 |c_~#top~0.offset|) (select .cse5 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse6) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse7 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse8 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse7 |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)))) (let ((.cse13 (store |c_#memory_int| |c_~#top~0.base| (store .cse14 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse12 (store (select .cse13 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse13 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base|))) (or (not (= (select .cse10 |c_~#top~0.offset|) .cse11)) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (v_ArrVal_16200 (Array Int Int))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (< v_ArrVal_16192 |c_thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) (<= 4 |c_~#top~0.base|) (= .cse11 |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse18 (select .cse17 |c_~#top~0.base|))) (let ((.cse19 (store .cse17 |c_~#top~0.base| (store .cse18 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse15 (store (select .cse19 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse16 (select (store .cse19 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#top~0.base|))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#top~0.base| (store .cse16 |c_~#top~0.offset| v_ArrVal_16192)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse17 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (< v_ArrVal_16192 |c_thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select .cse18 |c_~#top~0.offset|) (select .cse16 |c_~#top~0.offset|)))))))))) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse20 (select .cse25 |c_~#top~0.base|))) (or (not (= (select .cse20 |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse26 (store .cse20 |c_~#top~0.offset| v_ArrVal_16184)) (.cse27 (store (select (store .cse25 |c_~#top~0.base| (store .cse20 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse21 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse26) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse24 (select .cse21 |c_~#top~0.base|))) (let ((.cse28 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse24 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse22 (store (select .cse28 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse23 (select (store .cse28 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse22) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse21 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse22) |c_~#top~0.base| (store .cse23 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse24 |c_~#top~0.offset|) (select .cse23 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse25 |c_~#top~0.base| .cse26) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse27) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))))) is different from false [2025-04-14 14:23:23,051 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse9 (select .cse17 |c_~#top~0.offset|))) (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse1 (not (= |c_thr1Thread3of3ForFork0_push_#t~mem9#1| 1))) (.cse8 (= .cse9 |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) (and .cse0 (= |c_~#top~0.offset| 0) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (<= |c_~#m~0.base| 3) (or .cse1 (forall ((v_ArrVal_16200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21))) (let ((.cse6 (store .cse4 |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse3 (select .cse6 |c_~#top~0.base|))) (let ((.cse7 (store .cse6 |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse5 (store (select .cse7 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store .cse7 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base|))) (or (not (= (select .cse2 |c_~#top~0.offset|) (select .cse3 |c_~#top~0.offset|))) (= (select (select .cse4 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse5) |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse6 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1))))))))) .cse8) (or .cse1 (not (= .cse9 0))) (or (not .cse8) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse16 (store (select (store |c_#memory_int| |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse14 (store (store |c_#memory_int| |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| v_ArrVal_16184)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse16))) (let ((.cse12 (store .cse14 |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse12 |c_~#top~0.base|))) (let ((.cse15 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse16) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse13 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base|))) (or (not (= (select .cse10 |c_~#top~0.offset|) (select .cse11 |c_~#top~0.offset|))) (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse12 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1))))))))))) (<= 4 |c_~#top~0.base|) .cse8)))) is different from false [2025-04-14 14:23:23,063 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|)))) (and .cse0 (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (or (not (= |c_thr1Thread3of3ForFork0_push_#t~mem9#1| 1)) (forall ((v_ArrVal_16200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse7 (select .cse12 |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse13 (store .cse7 |c_~#top~0.offset| v_ArrVal_16184)) (.cse14 (store (select (store .cse12 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse8 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse8 |c_~#top~0.base|))) (let ((.cse15 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse9 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse8 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse11 |c_~#top~0.offset|) (select .cse10 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse12 |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:23:23,073 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse1 (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|))) (and (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse0 (select .cse6 |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) .cse1)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#top~0.offset| v_ArrVal_16184)) (.cse8 (store (select (store .cse6 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse5 (select .cse2 |c_~#top~0.base|))) (let ((.cse9 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse2 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse5 |c_~#top~0.offset|) (select .cse4 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse6 |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) .cse10 (or (and .cse10 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse15 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse12 (select .cse15 |c_~#top~0.base|))) (let ((.cse16 (store .cse15 |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse13 (store (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (select (store .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base|))) (or (not (= (select .cse11 |c_~#top~0.offset|) (select .cse12 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse14 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse15 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse1)))) (or (not (= |c_thr1Thread3of3ForFork0_push_#t~mem9#1| 1)) (forall ((v_ArrVal_16200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) is different from false [2025-04-14 14:23:23,336 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse7 (not (= |c_thr1Thread3of3ForFork0_push_#t~mem9#1| 1)))) (and .cse0 (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (or .cse7 (forall ((v_ArrVal_16200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or .cse7 (not (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse8 (select .cse13 |c_~#top~0.base|))) (or (not (= (select .cse8 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse14 (store .cse8 |c_~#top~0.offset| v_ArrVal_16184)) (.cse15 (store (select (store .cse13 |c_~#top~0.base| (store .cse8 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse14) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse12 (select .cse9 |c_~#top~0.base|))) (let ((.cse16 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse10 (store (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (select (store .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse10) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse9 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse10) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse12 |c_~#top~0.offset|) (select .cse11 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse13 |c_~#top~0.base| .cse14) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse15) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:23:45,663 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|))) (and (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse0 (select .cse6 |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) .cse1)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#top~0.offset| v_ArrVal_16184)) (.cse8 (store (select (store .cse6 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse5 (select .cse2 |c_~#top~0.base|))) (let ((.cse9 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse2 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse5 |c_~#top~0.offset|) (select .cse4 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse6 |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) (not (= |c_~#m~0.base| |c_~#top~0.base|)) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse14 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse14 |c_~#top~0.base|))) (let ((.cse15 (store .cse14 |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse12 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base|))) (or (not (= (select .cse10 |c_~#top~0.offset|) (select .cse11 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse13 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse14 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|) .cse1)))) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (or (not (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (forall ((v_ArrVal_16200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|) (= .cse1 |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) is different from false [2025-04-14 14:24:00,200 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse2 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse6 (select .cse11 |c_~#top~0.base|))) (or (not (= (select .cse6 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse12 (store .cse6 |c_~#top~0.offset| v_ArrVal_16184)) (.cse13 (store (select (store .cse11 |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse10 (select .cse7 |c_~#top~0.base|))) (let ((.cse14 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse8 (store (select .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse7 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse10 |c_~#top~0.offset|) (select .cse9 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse11 |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))))) is different from false [2025-04-14 14:24:00,289 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse4 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse1 (select .cse4 |c_~#top~0.base|))) (let ((.cse5 (store .cse4 |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse2 (store (select .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse0 (select (store .cse5 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) (select .cse1 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse2) |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse3 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))))) (= |c_~#top~0.offset| 0) (<= |c_~#m~0.base| 3) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (= |c_thr1Thread3of3ForFork0_push_#t~mem9#1| (select (select |c_#memory_int| |c_~#m~0.base|) |c_~#m~0.offset|)) (= |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 0) (= c_~next_alloc_idx~0 (+ 2 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (<= 4 |c_~#top~0.base|) (forall ((v_ArrVal_16179 (Array Int Int)) (v_ArrVal_16178 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse6 (select .cse11 |c_~#top~0.base|))) (or (not (= (select .cse6 |c_~#top~0.offset|) (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16178) |c_~#top~0.base|) |c_~#top~0.offset|))) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse12 (store .cse6 |c_~#top~0.offset| v_ArrVal_16184)) (.cse13 (store (select (store .cse11 |c_~#top~0.base| (store .cse6 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse10 (select .cse7 |c_~#top~0.base|))) (let ((.cse14 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse8 (store (select .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse14 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse7 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#top~0.base| (store .cse9 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse10 |c_~#top~0.offset|) (select .cse9 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse11 |c_~#top~0.base| .cse12) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse13) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))))) is different from false [2025-04-14 14:24:36,990 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse8 (select .cse11 |c_~#top~0.offset|))) (and (= |c_~#m~0.base| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) .cse0 (= |c_~#top~0.offset| 0) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (<= |c_~#m~0.base| 3) (= |c_~#m~0.offset| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) (or (not (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (forall ((v_ArrVal_16200 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)))) (let ((.cse10 (store |c_#memory_int| |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse9 (store (select .cse10 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse7 (select (store .cse10 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) .cse8)) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (v_ArrVal_16200 (Array Int Int))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (< v_ArrVal_16192 |c_thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| v_ArrVal_16192)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))))) (<= 4 |c_~#top~0.base|) (= .cse8 |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|) (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse15 (select .cse14 |c_~#top~0.base|))) (let ((.cse16 (store .cse14 |c_~#top~0.base| (store .cse15 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse12 (store (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse13 (select (store .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base|))) (or (not (= (select v_DerPreprocessor_19 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse12) |c_~#top~0.base| (store .cse13 |c_~#top~0.offset| v_ArrVal_16192)) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse14 |c_thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (< v_ArrVal_16192 |c_thr1Thread3of3ForFork0_push_~newTop~0#1|) (not (= (select .cse15 |c_~#top~0.offset|) (select .cse13 |c_~#top~0.offset|)))))))))) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse17 (select .cse22 |c_~#top~0.base|))) (or (not (= (select .cse17 |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse23 (store .cse17 |c_~#top~0.offset| v_ArrVal_16184)) (.cse24 (store (select (store .cse22 |c_~#top~0.base| (store .cse17 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse18 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse23) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse24) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse21 (select .cse18 |c_~#top~0.base|))) (let ((.cse25 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse24) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse21 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse19 (store (select .cse25 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse20 (select (store .cse25 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse19) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse18 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse19) |c_~#top~0.base| (store .cse20 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse21 |c_~#top~0.offset|) (select .cse20 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse22 |c_~#top~0.base| .cse23) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse24) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|))))))))))))))))) is different from false [2025-04-14 14:24:37,392 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_~#m~0.base| |c_~#top~0.base|)))) (and .cse0 (= |c_~#top~0.offset| 0) (or (and .cse0 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (<= |c_~#m~0.base| 3) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse2 (select .cse5 |c_~#top~0.base|))) (let ((.cse6 (store .cse5 |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse1 (select (store .cse6 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (not (= (select .cse1 |c_~#top~0.offset|) (select .cse2 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse4 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse5 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)))) (<= 4 |c_~#top~0.base|) (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse7 (select .cse12 |c_~#top~0.base|))) (or (not (= (select .cse7 |c_~#top~0.offset|) |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse13 (store .cse7 |c_~#top~0.offset| v_ArrVal_16184)) (.cse14 (store (select (store .cse12 |c_~#top~0.base| (store .cse7 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse8 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse11 (select .cse8 |c_~#top~0.base|))) (let ((.cse15 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse9 (store (select .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse15 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse8 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse9) |c_~#top~0.base| (store .cse10 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse11 |c_~#top~0.offset|) (select .cse10 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse12 |c_~#top~0.base| .cse13) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse14) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))))) is different from false [2025-04-14 14:24:43,853 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (not (= |c_~#m~0.base| |c_~#top~0.base|))) (.cse1 (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|))) (and (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (let ((.cse0 (select .cse6 |c_~#top~0.base|))) (or (not (= (select .cse0 |c_~#top~0.offset|) .cse1)) (forall ((|thr1Thread3of3ForFork0_push_~newTop~0#1| Int) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16184 Int) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int) (v_ArrVal_16200 (Array Int Int))) (let ((.cse7 (store .cse0 |c_~#top~0.offset| v_ArrVal_16184)) (.cse8 (store (select (store .cse6 |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| |thr1Thread3of3ForFork0_push_~newTop~0#1|)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse5 (select .cse2 |c_~#top~0.base|))) (let ((.cse9 (store (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_~#m~0.base| v_ArrVal_16185) |c_~#top~0.base| (store .cse5 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse3 (store (select .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse4 (select (store .cse9 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base|))) (or (< |thr1Thread3of3ForFork0_push_~newTop~0#1| v_ArrVal_16184) (< v_ArrVal_16192 |thr1Thread3of3ForFork0_push_~newTop~0#1|) (= (select (select .cse2 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse3) |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (not (= (select .cse5 |c_~#top~0.offset|) (select .cse4 |c_~#top~0.offset|))) (= 1 (select (select (store (store .cse6 |c_~#top~0.base| .cse7) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| .cse8) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|)))))))))))))) .cse10 (= |c_~#top~0.offset| 0) (or (and .cse10 (<= 1 |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)) (< c_~next_alloc_idx~0 65)) (<= |c_~#m~0.base| 3) (forall ((v_ArrVal_16179 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_16179))) (or (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_16192 Int) (|thr1Thread3of3ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_16185 (Array Int Int)) (v_ArrVal_16200 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#casret~0#1.offset| Int)) (let ((.cse15 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_~#m~0.base| v_ArrVal_16185))) (let ((.cse12 (select .cse15 |c_~#top~0.base|))) (let ((.cse16 (store .cse15 |c_~#top~0.base| (store .cse12 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_~newTop~0#1|)))) (let ((.cse13 (store (select .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset| 1))) (let ((.cse11 (select (store .cse16 |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base|))) (or (not (= (select .cse11 |c_~#top~0.offset|) (select .cse12 |c_~#top~0.offset|))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base| .cse13) |c_~#top~0.base| (store .cse11 |c_~#top~0.offset| v_ArrVal_16192)) |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#m~0.base| v_ArrVal_16200) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select (store .cse14 |thr1Thread3of3ForFork0_push_~#casret~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#casret~0#1.offset|) 1) (not (= (select v_DerPreprocessor_19 |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)) (= (select (select .cse15 |thr1Thread3of3ForFork0_push_~#casret~0#1.base|) |thr1Thread3of3ForFork0_push_~#casret~0#1.offset|) 1)))))))) (= (select (select .cse14 |c_~#top~0.base|) |c_~#top~0.offset|) .cse1)))) (<= 4 |c_~#top~0.base|) (= .cse1 |c_thr1Thread3of3ForFork0_push_~oldTop~0#1|))) is different from false [2025-04-14 14:24:57,459 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2025-04-14 14:24:58,498 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 14:24:58,499 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 14:24:58,499 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 14:24:59,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 14:24:59,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 14:24:59,699 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 14:24:59,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-14 14:24:59,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-14 14:24:59,776 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 14:24:59,776 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 14:24:59,781 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 14:24:59,781 INFO L320 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was TIMEOUT (1/4) [2025-04-14 14:24:59,782 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2025-04-14 14:24:59,782 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 14:24:59,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 02:24:59 BasicIcfg [2025-04-14 14:24:59,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 14:24:59,786 INFO L158 Benchmark]: Toolchain (without parser) took 813152.72ms. Allocated memory was 125.8MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 87.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-04-14 14:24:59,787 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 14:24:59,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.60ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 62.6MB in the end (delta: 24.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 14:24:59,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.74ms. Allocated memory is still 125.8MB. Free memory was 62.6MB in the beginning and 59.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 14:24:59,787 INFO L158 Benchmark]: Boogie Preprocessor took 34.32ms. Allocated memory is still 125.8MB. Free memory was 59.9MB in the beginning and 58.5MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 14:24:59,788 INFO L158 Benchmark]: IcfgBuilder took 754.53ms. Allocated memory is still 125.8MB. Free memory was 58.5MB in the beginning and 73.5MB in the end (delta: -15.0MB). Peak memory consumption was 46.0MB. Max. memory is 8.0GB. [2025-04-14 14:24:59,788 INFO L158 Benchmark]: TraceAbstraction took 811954.60ms. Allocated memory was 125.8MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 73.5MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2025-04-14 14:24:59,789 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.12ms. Allocated memory is still 155.2MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 361.60ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 62.6MB in the end (delta: 24.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.74ms. Allocated memory is still 125.8MB. Free memory was 62.6MB in the beginning and 59.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 34.32ms. Allocated memory is still 125.8MB. Free memory was 59.9MB in the beginning and 58.5MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 754.53ms. Allocated memory is still 125.8MB. Free memory was 58.5MB in the beginning and 73.5MB in the end (delta: -15.0MB). Peak memory consumption was 46.0MB. Max. memory is 8.0GB. * TraceAbstraction took 811954.60ms. Allocated memory was 125.8MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 73.5MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 1.8GB. 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: 1529, independent: 1140, independent conditional: 735, independent unconditional: 405, dependent: 389, dependent conditional: 368, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1161, independent: 1140, independent conditional: 735, independent unconditional: 405, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1161, independent: 1140, independent conditional: 735, independent unconditional: 405, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1161, independent: 1140, independent conditional: 735, independent unconditional: 405, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1161, independent: 1140, independent conditional: 0, independent unconditional: 1140, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1161, independent: 1140, independent conditional: 0, independent unconditional: 1140, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 310, independent: 289, independent conditional: 0, independent unconditional: 289, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 310, independent: 279, independent conditional: 0, independent unconditional: 279, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 31, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 536, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 291, dependent conditional: 0, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1161, independent: 851, independent conditional: 0, independent unconditional: 851, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 310, unknown conditional: 0, unknown unconditional: 310] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 289, Positive conditional cache size: 0, Positive unconditional cache size: 289, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 735, Maximal queried relation: 0, Independence queries for same thread: 368, Persistent sets #1 benchmarks: Persistent set computation time: 0.6s, Number of persistent set computation: 96, Number of trivial persistent sets: 83, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 426, independent: 405, independent conditional: 0, independent unconditional: 405, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1529, independent: 1140, independent conditional: 735, independent unconditional: 405, dependent: 389, dependent conditional: 368, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1161, independent: 1140, independent conditional: 735, independent unconditional: 405, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1161, independent: 1140, independent conditional: 735, independent unconditional: 405, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1161, independent: 1140, independent conditional: 735, independent unconditional: 405, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1161, independent: 1140, independent conditional: 0, independent unconditional: 1140, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1161, independent: 1140, independent conditional: 0, independent unconditional: 1140, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 310, independent: 289, independent conditional: 0, independent unconditional: 289, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 310, independent: 279, independent conditional: 0, independent unconditional: 279, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 31, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 536, independent: 244, independent conditional: 0, independent unconditional: 244, dependent: 291, dependent conditional: 0, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1161, independent: 851, independent conditional: 0, independent unconditional: 851, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 310, unknown conditional: 0, unknown unconditional: 310] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 289, Positive conditional cache size: 0, Positive unconditional cache size: 289, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 735, Maximal queried relation: 0, Independence queries for same thread: 368 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 327, independent: 301, independent conditional: 52, independent unconditional: 249, dependent: 26, dependent conditional: 22, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 305, independent: 301, independent conditional: 52, independent unconditional: 249, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 305, independent: 301, independent conditional: 52, independent unconditional: 249, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 305, independent: 301, independent conditional: 52, independent unconditional: 249, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 305, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 305, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 305, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 289, Positive conditional cache size: 0, Positive unconditional cache size: 289, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0, Independence queries for same thread: 22, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 23, Number of trivial persistent sets: 21, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 253, independent: 249, independent conditional: 0, independent unconditional: 249, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 327, independent: 301, independent conditional: 52, independent unconditional: 249, dependent: 26, dependent conditional: 22, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 305, independent: 301, independent conditional: 52, independent unconditional: 249, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 305, independent: 301, independent conditional: 52, independent unconditional: 249, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 305, independent: 301, independent conditional: 52, independent unconditional: 249, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 305, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 305, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 305, independent: 301, independent conditional: 0, independent unconditional: 301, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 289, Positive conditional cache size: 0, Positive unconditional cache size: 289, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0, Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1983, independent: 1762, independent conditional: 502, independent unconditional: 1260, dependent: 221, dependent conditional: 173, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1840, independent: 1762, independent conditional: 502, independent unconditional: 1260, dependent: 78, dependent conditional: 30, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1840, independent: 1762, independent conditional: 502, independent unconditional: 1260, dependent: 78, dependent conditional: 30, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1879, independent: 1762, independent conditional: 502, independent unconditional: 1260, dependent: 117, dependent conditional: 69, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1879, independent: 1762, independent conditional: 0, independent unconditional: 1762, dependent: 117, dependent conditional: 11, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1879, independent: 1762, independent conditional: 0, independent unconditional: 1762, dependent: 117, dependent conditional: 11, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1137, independent: 1082, independent conditional: 0, independent unconditional: 1082, dependent: 55, dependent conditional: 7, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1137, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 95, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 55, dependent conditional: 7, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 55, dependent conditional: 7, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1561, independent: 674, independent conditional: 0, independent unconditional: 674, dependent: 888, dependent conditional: 170, dependent unconditional: 717, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1879, independent: 680, independent conditional: 0, independent unconditional: 680, dependent: 62, dependent conditional: 4, dependent unconditional: 58, unknown: 1137, unknown conditional: 7, unknown unconditional: 1130] , Statistics on independence cache: Total cache size (in pairs): 1447, Positive cache size: 1371, Positive conditional cache size: 0, Positive unconditional cache size: 1371, Negative cache size: 76, Negative conditional cache size: 7, Negative unconditional cache size: 69, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 560, Maximal queried relation: 3, Independence queries for same thread: 143, Persistent sets #1 benchmarks: Persistent set computation time: 1.4s, Number of persistent set computation: 75, Number of trivial persistent sets: 62, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1308, independent: 1260, independent conditional: 0, independent unconditional: 1260, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1983, independent: 1762, independent conditional: 502, independent unconditional: 1260, dependent: 221, dependent conditional: 173, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1840, independent: 1762, independent conditional: 502, independent unconditional: 1260, dependent: 78, dependent conditional: 30, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1840, independent: 1762, independent conditional: 502, independent unconditional: 1260, dependent: 78, dependent conditional: 30, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1879, independent: 1762, independent conditional: 502, independent unconditional: 1260, dependent: 117, dependent conditional: 69, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1879, independent: 1762, independent conditional: 0, independent unconditional: 1762, dependent: 117, dependent conditional: 11, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1879, independent: 1762, independent conditional: 0, independent unconditional: 1762, dependent: 117, dependent conditional: 11, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1137, independent: 1082, independent conditional: 0, independent unconditional: 1082, dependent: 55, dependent conditional: 7, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1137, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 95, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 55, dependent conditional: 7, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 95, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 55, dependent conditional: 7, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1561, independent: 674, independent conditional: 0, independent unconditional: 674, dependent: 888, dependent conditional: 170, dependent unconditional: 717, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1879, independent: 680, independent conditional: 0, independent unconditional: 680, dependent: 62, dependent conditional: 4, dependent unconditional: 58, unknown: 1137, unknown conditional: 7, unknown unconditional: 1130] , Statistics on independence cache: Total cache size (in pairs): 1447, Positive cache size: 1371, Positive conditional cache size: 0, Positive unconditional cache size: 1371, Negative cache size: 76, Negative conditional cache size: 7, Negative unconditional cache size: 69, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 560, Maximal queried relation: 3, Independence queries for same thread: 143 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4362200, independent: 3713187, independent conditional: 3708416, independent unconditional: 4771, dependent: 648210, dependent conditional: 647907, dependent unconditional: 303, unknown: 803, unknown conditional: 803, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3868401, independent: 3713187, independent conditional: 3708416, independent unconditional: 4771, dependent: 154411, dependent conditional: 154108, dependent unconditional: 303, unknown: 803, unknown conditional: 803, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3868401, independent: 3713187, independent conditional: 3708416, independent unconditional: 4771, dependent: 154411, dependent conditional: 154108, dependent unconditional: 303, unknown: 803, unknown conditional: 803, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6025031, independent: 3713187, independent conditional: 3708416, independent unconditional: 4771, dependent: 2310782, dependent conditional: 2310479, dependent unconditional: 303, unknown: 1062, unknown conditional: 1062, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6025031, independent: 3713187, independent conditional: 127815, independent unconditional: 3585372, dependent: 2310782, dependent conditional: 809224, dependent unconditional: 1501558, unknown: 1062, unknown conditional: 1062, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6025031, independent: 3713187, independent conditional: 127815, independent unconditional: 3585372, dependent: 2310782, dependent conditional: 809224, dependent unconditional: 1501558, unknown: 1062, unknown conditional: 1062, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13345, independent: 6016, independent conditional: 2036, independent unconditional: 3980, dependent: 7275, dependent conditional: 6960, dependent unconditional: 315, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13345, independent: 3789, independent conditional: 0, independent unconditional: 3789, dependent: 9556, dependent conditional: 0, dependent unconditional: 9556, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9556, independent: 2227, independent conditional: 2036, independent unconditional: 191, dependent: 7275, dependent conditional: 6960, dependent unconditional: 315, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9556, independent: 2227, independent conditional: 2036, independent unconditional: 191, dependent: 7275, dependent conditional: 6960, dependent unconditional: 315, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153851, independent: 32307, independent conditional: 29792, independent unconditional: 2515, dependent: 120316, dependent conditional: 116268, dependent unconditional: 4048, unknown: 1228, unknown conditional: 1228, unknown unconditional: 0] , Symbolic Condition Computations: 2, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 6025031, independent: 3707171, independent conditional: 125779, independent unconditional: 3581392, dependent: 2303507, dependent conditional: 802264, dependent unconditional: 1501243, unknown: 14353, unknown conditional: 10058, unknown unconditional: 4295] , Statistics on independence cache: Total cache size (in pairs): 14787, Positive cache size: 7389, Positive conditional cache size: 2038, Positive unconditional cache size: 5351, Negative cache size: 7344, Negative conditional cache size: 6960, Negative unconditional cache size: 384, Unknown cache size: 54, Unknown conditional cache size: 54, Unknown unconditional cache size: 0, Eliminated conditions: 5081856, Maximal queried relation: 22, Independence queries for same thread: 493799, Persistent sets #1 benchmarks: Persistent set computation time: 6.3s, Number of persistent set computation: 6577, Number of trivial persistent sets: 6102, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5074, independent: 4771, independent conditional: 0, independent unconditional: 4771, dependent: 303, dependent conditional: 0, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4362200, independent: 3713187, independent conditional: 3708416, independent unconditional: 4771, dependent: 648210, dependent conditional: 647907, dependent unconditional: 303, unknown: 803, unknown conditional: 803, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3868401, independent: 3713187, independent conditional: 3708416, independent unconditional: 4771, dependent: 154411, dependent conditional: 154108, dependent unconditional: 303, unknown: 803, unknown conditional: 803, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3868401, independent: 3713187, independent conditional: 3708416, independent unconditional: 4771, dependent: 154411, dependent conditional: 154108, dependent unconditional: 303, unknown: 803, unknown conditional: 803, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6025031, independent: 3713187, independent conditional: 3708416, independent unconditional: 4771, dependent: 2310782, dependent conditional: 2310479, dependent unconditional: 303, unknown: 1062, unknown conditional: 1062, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6025031, independent: 3713187, independent conditional: 127815, independent unconditional: 3585372, dependent: 2310782, dependent conditional: 809224, dependent unconditional: 1501558, unknown: 1062, unknown conditional: 1062, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6025031, independent: 3713187, independent conditional: 127815, independent unconditional: 3585372, dependent: 2310782, dependent conditional: 809224, dependent unconditional: 1501558, unknown: 1062, unknown conditional: 1062, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13345, independent: 6016, independent conditional: 2036, independent unconditional: 3980, dependent: 7275, dependent conditional: 6960, dependent unconditional: 315, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13345, independent: 3789, independent conditional: 0, independent unconditional: 3789, dependent: 9556, dependent conditional: 0, dependent unconditional: 9556, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9556, independent: 2227, independent conditional: 2036, independent unconditional: 191, dependent: 7275, dependent conditional: 6960, dependent unconditional: 315, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9556, independent: 2227, independent conditional: 2036, independent unconditional: 191, dependent: 7275, dependent conditional: 6960, dependent unconditional: 315, unknown: 54, unknown conditional: 54, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153851, independent: 32307, independent conditional: 29792, independent unconditional: 2515, dependent: 120316, dependent conditional: 116268, dependent unconditional: 4048, unknown: 1228, unknown conditional: 1228, unknown unconditional: 0] , Symbolic Condition Computations: 2, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 6025031, independent: 3707171, independent conditional: 125779, independent unconditional: 3581392, dependent: 2303507, dependent conditional: 802264, dependent unconditional: 1501243, unknown: 14353, unknown conditional: 10058, unknown unconditional: 4295] , Statistics on independence cache: Total cache size (in pairs): 14787, Positive cache size: 7389, Positive conditional cache size: 2038, Positive unconditional cache size: 5351, Negative cache size: 7344, Negative conditional cache size: 6960, Negative unconditional cache size: 384, Unknown cache size: 54, Unknown conditional cache size: 54, Unknown unconditional cache size: 0, Eliminated conditions: 5081856, Maximal queried relation: 22, Independence queries for same thread: 493799 - TimeoutResultAtElement [Line: 763]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr1Thread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 54 locations, 65 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.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: 91, 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, 2.3s InterpolantComputationTime, 493 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 566 ConstructedInterpolants, 6 QuantifiedInterpolants, 2028 SizeOfPredicates, 9 NumberOfNonLiveVariables, 843 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 371/422 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 27, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 54 locations, 65 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, 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: 5, 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.0s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 55 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 2 thread instances CFG has 4 procedures, 78 locations, 95 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 2.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: 25, 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.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr1Thread3of3ForFork0 with 1 thread instances CFG has 5 procedures, 102 locations, 125 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 799.8s, OverallIterations: 33, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 685.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: 2096, 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: 1.0s SsaConstructionTime, 12.2s SatisfiabilityAnalysisTime, 86.9s InterpolantComputationTime, 9849 NumberOfCodeBlocks, 8613 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 12547 ConstructedInterpolants, 107 QuantifiedInterpolants, 95492 SizeOfPredicates, 73 NumberOfNonLiveVariables, 15510 ConjunctsInSsa, 521 ConjunctsInUnsatCore, 46 InterpolantComputations, 25 PerfectInterpolantSequences, 14199/28444 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: SuccessfulCommutativityProofs: 1, ConComChecker Statistics: CheckTime [ms]: 3226, ConditionCalculationTime [ms]: 33, ConditionCalculations: 54, QuantifiedConditions: 0, TraceChecks: 2, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 1 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown