/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/09-regions_16-arrayloop_rc.line762.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 12:23:16,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 12:23:16,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 12:23:16,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 12:23:16,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 12:23:16,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 12:23:16,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 12:23:16,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 12:23:16,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 12:23:16,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 12:23:16,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 12:23:16,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 12:23:16,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 12:23:16,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 12:23:16,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 12:23:16,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 12:23:16,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 12:23:16,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 12:23:16,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 12:23:16,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 12:23:16,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 12:23:16,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 12:23:16,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 12:23:16,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 12:23:16,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 12:23:16,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 12:23:16,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 12:23:16,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 12:23:16,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 12:23:16,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 12:23:16,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 12:23:16,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 12:23:16,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 12:23:16,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 12:23:16,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 12:23:16,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 12:23:16,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 12:23:16,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 12:23:16,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 12:23:16,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 12:23:16,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 12:23:16,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-03 12:23:16,597 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 12:23:16,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 12:23:16,597 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 12:23:16,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 12:23:16,598 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 12:23:16,598 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 12:23:16,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 12:23:16,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 12:23:16,599 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 12:23:16,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 12:23:16,599 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 12:23:16,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 12:23:16,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 12:23:16,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 12:23:16,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 12:23:16,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 12:23:16,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 12:23:16,600 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 12:23:16,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 12:23:16,600 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 12:23:16,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 12:23:16,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 12:23:16,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 12:23:16,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 12:23:16,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 12:23:16,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 12:23:16,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 12:23:16,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 12:23:16,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 12:23:16,602 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 12:23:16,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 12:23:16,602 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 12:23:16,602 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 12:23:16,602 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 12:23:16,602 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 12:23:16,602 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 12:23:16,602 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 12:23:16,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 12:23:16,603 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-03 12:23:16,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 12:23:16,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 12:23:16,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 12:23:16,812 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 12:23:16,813 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 12:23:16,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/09-regions_16-arrayloop_rc.line762.bpl [2022-10-03 12:23:16,814 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/09-regions_16-arrayloop_rc.line762.bpl' [2022-10-03 12:23:16,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 12:23:16,866 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 12:23:16,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 12:23:16,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 12:23:16,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 12:23:16,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:23:16" (1/1) ... [2022-10-03 12:23:16,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:23:16" (1/1) ... [2022-10-03 12:23:16,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:23:16" (1/1) ... [2022-10-03 12:23:16,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:23:16" (1/1) ... [2022-10-03 12:23:16,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:23:16" (1/1) ... [2022-10-03 12:23:16,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:23:16" (1/1) ... [2022-10-03 12:23:16,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:23:16" (1/1) ... [2022-10-03 12:23:16,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 12:23:16,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 12:23:16,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 12:23:16,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 12:23:16,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:23:16" (1/1) ... [2022-10-03 12:23:16,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 12:23:16,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:23:16,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-03 12:23:16,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-03 12:23:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-10-03 12:23:16,982 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-10-03 12:23:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 12:23:16,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 12:23:16,983 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-03 12:23:17,125 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 12:23:17,126 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 12:23:17,464 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 12:23:17,473 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 12:23:17,473 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-03 12:23:17,475 INFO L202 PluginConnector]: Adding new model 09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:23:17 BoogieIcfgContainer [2022-10-03 12:23:17,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 12:23:17,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 12:23:17,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 12:23:17,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 12:23:17,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:23:16" (1/2) ... [2022-10-03 12:23:17,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff20f00 and model type 09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 12:23:17, skipping insertion in model container [2022-10-03 12:23:17,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:23:17" (2/2) ... [2022-10-03 12:23:17,491 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_16-arrayloop_rc.line762.bpl [2022-10-03 12:23:17,496 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 12:23:17,502 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 12:23:17,502 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 12:23:17,502 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 12:23:17,587 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-03 12:23:17,621 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 12:23:17,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 12:23:17,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:23:17,623 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) [2022-10-03 12:23:17,624 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 [2022-10-03 12:23:17,647 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 12:23:17,652 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 12:23:17,656 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@9f44ac2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 12:23:17,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 12:23:17,865 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:23:17,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:23:17,869 INFO L85 PathProgramCache]: Analyzing trace with hash -70554807, now seen corresponding path program 1 times [2022-10-03 12:23:17,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:23:17,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600046755] [2022-10-03 12:23:17,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:23:17,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:23:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:23:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:23:18,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:23:18,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600046755] [2022-10-03 12:23:18,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600046755] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 12:23:18,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 12:23:18,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 12:23:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152424476] [2022-10-03 12:23:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 12:23:18,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 12:23:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:23:18,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 12:23:18,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 12:23:18,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:18,101 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:23:18,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 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) [2022-10-03 12:23:18,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:18,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:18,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 12:23:18,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:23:18,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:23:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash -342991094, now seen corresponding path program 1 times [2022-10-03 12:23:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:23:18,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365466165] [2022-10-03 12:23:18,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:23:18,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:23:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:23:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:23:18,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:23:18,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365466165] [2022-10-03 12:23:18,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365466165] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 12:23:18,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 12:23:18,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-03 12:23:18,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193411361] [2022-10-03 12:23:18,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 12:23:18,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-03 12:23:18,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:23:18,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-03 12:23:18,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-03 12:23:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:18,208 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:23:18,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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) [2022-10-03 12:23:18,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:18,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:23:18,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 12:23:18,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:23:18,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:23:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1183963772, now seen corresponding path program 1 times [2022-10-03 12:23:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:23:18,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953621153] [2022-10-03 12:23:18,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:23:18,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:23:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:23:18,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:23:18,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:23:18,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953621153] [2022-10-03 12:23:18,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953621153] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:23:18,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201252693] [2022-10-03 12:23:18,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:23:18,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:23:18,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:23:18,403 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) [2022-10-03 12:23:18,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-03 12:23:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:23:18,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-03 12:23:18,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:23:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:23:18,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:23:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:23:18,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201252693] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 12:23:18,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 12:23:18,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-03 12:23:18,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036137132] [2022-10-03 12:23:18,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 12:23:18,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-03 12:23:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:23:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-03 12:23:18,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-03 12:23:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:18,847 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:23:18,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.1) internal successors, (351), 10 states have internal predecessors, (351), 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) [2022-10-03 12:23:18,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:18,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:23:18,847 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:23:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:23:19,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-03 12:23:19,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-10-03 12:23:19,196 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:23:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:23:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1665130692, now seen corresponding path program 2 times [2022-10-03 12:23:19,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:23:19,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715901629] [2022-10-03 12:23:19,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:23:19,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:23:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:23:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:23:19,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:23:19,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715901629] [2022-10-03 12:23:19,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715901629] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:23:19,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985300717] [2022-10-03 12:23:19,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 12:23:19,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:23:19,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:23:19,390 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) [2022-10-03 12:23:19,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-03 12:23:19,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-03 12:23:19,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 12:23:19,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-03 12:23:19,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:23:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:23:19,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:23:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:23:20,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985300717] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 12:23:20,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 12:23:20,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-10-03 12:23:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563508759] [2022-10-03 12:23:20,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 12:23:20,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-03 12:23:20,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:23:20,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-03 12:23:20,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-10-03 12:23:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:20,016 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:23:20,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 31.27777777777778) internal successors, (563), 18 states have internal predecessors, (563), 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) [2022-10-03 12:23:20,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:20,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:23:20,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:23:20,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:23:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:23:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:23:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 12:23:20,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-03 12:23:20,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:23:20,402 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:23:20,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:23:20,402 INFO L85 PathProgramCache]: Analyzing trace with hash 896587964, now seen corresponding path program 3 times [2022-10-03 12:23:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:23:20,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250349694] [2022-10-03 12:23:20,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:23:20,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:23:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:23:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 0 proven. 1120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:23:20,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:23:20,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250349694] [2022-10-03 12:23:20,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250349694] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:23:20,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242849086] [2022-10-03 12:23:20,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-03 12:23:20,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:23:20,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:23:20,768 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) [2022-10-03 12:23:20,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-03 12:24:07,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-10-03 12:24:07,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 12:24:07,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 1548 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-03 12:24:07,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:24:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 0 proven. 1120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:24:07,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:24:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 0 proven. 1120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:24:08,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242849086] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 12:24:08,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 12:24:08,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-10-03 12:24:08,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987185480] [2022-10-03 12:24:08,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 12:24:08,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-03 12:24:08,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:24:08,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-03 12:24:08,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-10-03 12:24:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:24:08,052 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:24:08,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 31.391304347826086) internal successors, (722), 23 states have internal predecessors, (722), 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) [2022-10-03 12:24:08,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:24:08,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:24:08,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:24:08,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 12:24:08,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:24:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:24:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:24:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:24:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 12:24:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-03 12:24:08,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-03 12:24:08,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:24:08,577 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:24:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:24:08,578 INFO L85 PathProgramCache]: Analyzing trace with hash 231477066, now seen corresponding path program 4 times [2022-10-03 12:24:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:24:08,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601363489] [2022-10-03 12:24:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:24:08,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:24:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:24:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 476 proven. 1919 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:24:32,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:24:32,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601363489] [2022-10-03 12:24:32,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601363489] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:24:32,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825964967] [2022-10-03 12:24:32,375 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-03 12:24:32,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:24:32,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:24:32,377 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) [2022-10-03 12:24:32,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-03 12:24:32,897 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-03 12:24:32,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 12:24:32,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 395 conjunts are in the unsatisfiable core [2022-10-03 12:24:32,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:24:33,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-10-03 12:24:34,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-10-03 12:24:34,467 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 12:24:34,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 18 [2022-10-03 12:24:36,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-10-03 12:24:37,262 INFO L356 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-10-03 12:24:37,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2022-10-03 12:24:37,536 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-03 12:24:37,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 38 [2022-10-03 12:24:38,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 45 [2022-10-03 12:24:39,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 45 [2022-10-03 12:24:41,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:24:41,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 97 treesize of output 76 [2022-10-03 12:24:43,912 INFO L356 Elim1Store]: treesize reduction 174, result has 31.0 percent of original size [2022-10-03 12:24:43,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 93 treesize of output 153 [2022-10-03 12:24:44,696 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-10-03 12:24:44,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 104 treesize of output 116 [2022-10-03 12:24:47,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 139 treesize of output 127 [2022-10-03 12:24:48,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 139 treesize of output 127 [2022-10-03 12:24:51,256 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-10-03 12:24:51,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 150 treesize of output 162 [2022-10-03 12:24:51,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:24:51,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-10-03 12:24:53,767 INFO L356 Elim1Store]: treesize reduction 84, result has 34.9 percent of original size [2022-10-03 12:24:53,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 65 [2022-10-03 12:24:55,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-10-03 12:24:56,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-10-03 12:24:57,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:24:57,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2022-10-03 12:24:59,339 INFO L356 Elim1Store]: treesize reduction 84, result has 34.9 percent of original size [2022-10-03 12:24:59,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 65 [2022-10-03 12:25:01,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-10-03 12:25:02,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-10-03 12:25:04,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:25:04,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2022-10-03 12:25:06,390 INFO L356 Elim1Store]: treesize reduction 102, result has 34.6 percent of original size [2022-10-03 12:25:06,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 77 [2022-10-03 12:25:08,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2022-10-03 12:25:09,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2022-10-03 12:25:11,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:25:11,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2022-10-03 12:25:14,065 INFO L356 Elim1Store]: treesize reduction 102, result has 34.6 percent of original size [2022-10-03 12:25:14,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 77 [2022-10-03 12:25:16,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2022-10-03 12:25:17,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2022-10-03 12:25:19,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:25:19,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2022-10-03 12:25:21,983 INFO L356 Elim1Store]: treesize reduction 102, result has 34.6 percent of original size [2022-10-03 12:25:21,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 77 [2022-10-03 12:25:24,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2022-10-03 12:25:25,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2022-10-03 12:25:27,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:25:27,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2022-10-03 12:25:30,120 INFO L356 Elim1Store]: treesize reduction 102, result has 34.6 percent of original size [2022-10-03 12:25:30,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 77 [2022-10-03 12:25:32,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2022-10-03 12:25:33,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2022-10-03 12:25:35,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:25:35,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 36 [2022-10-03 12:25:38,508 INFO L356 Elim1Store]: treesize reduction 102, result has 34.6 percent of original size [2022-10-03 12:25:38,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 77 [2022-10-03 12:25:41,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2022-10-03 12:25:43,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2022-10-03 12:25:48,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:25:48,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2022-10-03 12:26:18,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2022-10-03 12:26:41,358 INFO L356 Elim1Store]: treesize reduction 24, result has 54.7 percent of original size [2022-10-03 12:26:41,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 50 [2022-10-03 12:26:43,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-10-03 12:26:43,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-10-03 12:26:47,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 12:26:47,302 INFO L356 Elim1Store]: treesize reduction 57, result has 16.2 percent of original size [2022-10-03 12:26:47,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 46 [2022-10-03 12:26:47,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-10-03 12:26:48,369 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-03 12:26:48,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 123 [2022-10-03 12:26:48,377 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 12:26:48,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 115 [2022-10-03 12:26:48,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 51 [2022-10-03 12:26:49,691 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-03 12:26:49,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 24 [2022-10-03 12:26:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 1006 proven. 1389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:26:50,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:26:51,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (let ((.cse0 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1373))) (select .cse0 (select (select .cse0 |c_~#slot~0.base|) .cse1))) (+ (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1374) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:26:51,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1373))) (select .cse0 (select (select .cse0 |c_~#slot~0.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1374) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:26:52,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (let ((.cse0 (store (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| (store (select |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_write~$Pointer$_#ptr#1.offset| |c_ULTIMATE.start_write~$Pointer$_#value#1.base|)) |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1373))) (select .cse0 (select (select .cse0 |c_~#slot~0.base|) .cse1))) (+ (select (select (store (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1370) |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1374) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:26:53,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_~list#1.base|) (+ 4 |c_ULTIMATE.start_list_add_~list#1.offset|) |c_ULTIMATE.start_list_add_~node#1.base|)) |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1373))) (select .cse0 (select (select .cse0 |c_~#slot~0.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_~list#1.base| v_ArrVal_1370) |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1374) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:26:53,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_#in~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_#in~list#1.base|) (+ |c_ULTIMATE.start_list_add_#in~list#1.offset| 4) |c_ULTIMATE.start_list_add_~node#1.base|)) |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1373))) (select .cse0 (select (select .cse0 |c_~#slot~0.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_#in~list#1.base| v_ArrVal_1370) |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1374) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:26:53,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_#in~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_list_add_#in~list#1.base|) (+ |c_ULTIMATE.start_list_add_#in~list#1.offset| 4) |c_ULTIMATE.start_list_add_#in~node#1.base|)) |c_ULTIMATE.start_list_add_#in~node#1.base| v_ArrVal_1373))) (select .cse0 (select (select .cse0 |c_~#slot~0.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_list_add_#in~list#1.base| v_ArrVal_1370) |c_ULTIMATE.start_list_add_#in~node#1.base| v_ArrVal_1374) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:26:53,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem43#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem43#1.base|) (+ |c_ULTIMATE.start_main_#t~mem43#1.offset| 4) |c_ULTIMATE.start_main_#t~ret42#1.base|)) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse0 (select (select .cse0 |c_~#slot~0.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_1370) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:26:53,188 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#value#1.base|) (+ |c_ULTIMATE.start_read~$Pointer$_#value#1.offset| 4) |c_ULTIMATE.start_main_#t~ret42#1.base|)) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse0 (select (select .cse0 |c_~#slot~0.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_read~$Pointer$_#value#1.base| v_ArrVal_1370) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:26:53,209 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 12:26:53,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 706 treesize of output 641 [2022-10-03 12:26:53,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 313 treesize of output 301 [2022-10-03 12:26:53,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 614 treesize of output 590 [2022-10-03 12:26:53,858 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_main_#t~ret42#1.base| |c_~#slot~0.base|)) (.cse2 (= |c_~#slot~0.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)))) (let ((.cse3 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse68 (+ v_arrayElimCell_106 4))) (let ((.cse67 (let ((.cse69 (store (let ((.cse70 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse70 (store (select |c_#memory_$Pointer$.base| .cse70) .cse68 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse69 (select (select .cse69 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse67 .cse68)) 1) (= (select |c_#valid| (select .cse67 (+ v_arrayElimCell_108 4))) 1)))))) (.cse9 (not .cse2)) (.cse14 (not .cse5))) (let ((.cse0 (let ((.cse46 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int) (v_arrayElimCell_108 Int)) (let ((.cse64 (let ((.cse65 (store (let ((.cse66 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse66 (store (select |c_#memory_$Pointer$.base| .cse66) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse65 (select (select .cse65 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse64 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse64 (+ v_arrayElimCell_106 4))) 1)))))) (let ((.cse37 (or .cse14 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_105 Int) (v_arrayElimCell_108 Int)) (= (select |c_#valid| (select (let ((.cse62 (store (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse63 (store (select |c_#memory_$Pointer$.base| .cse63) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse62 (select (select .cse62 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_108 4))) 1)))) (.cse36 (or .cse2 .cse46)) (.cse40 (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int)) (= (select |c_#valid| (select (let ((.cse60 (store (let ((.cse61 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse61 (store (select |c_#memory_$Pointer$.base| .cse61) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse60 (select (select .cse60 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_106 4))) 1)) .cse2)) (.cse41 (or .cse9 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_105 Int) (v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (let ((.cse57 (let ((.cse58 (store (let ((.cse59 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse59 (store (select |c_#memory_$Pointer$.base| .cse59) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse58 (select (select .cse58 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse57 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse57 (+ v_arrayElimCell_107 4))) 1)))))) (.cse47 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int) (v_arrayElimCell_108 Int)) (let ((.cse52 (let ((.cse55 (store (let ((.cse56 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse56 (store (select |c_#memory_$Pointer$.base| .cse56) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse55 (select (select .cse55 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse52 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse52 (+ v_arrayElimCell_106 4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse53 (store (let ((.cse54 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse54 (store (select |c_#memory_$Pointer$.base| .cse54) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse53 (select (select .cse53 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1))))))) (and .cse36 .cse37 (or .cse5 (and (or .cse9 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_105 Int) (v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse38 (store (let ((.cse39 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse39 (store (select |c_#memory_$Pointer$.base| .cse39) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse38 (select (select .cse38 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1))) .cse36 .cse40 .cse41 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int)) (or (= (select |c_#valid| (select (let ((.cse42 (store (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse43 (store (select |c_#memory_$Pointer$.base| .cse43) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse42 (select (select .cse42 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_106 4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse44 (store (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse45 (store (select |c_#memory_$Pointer$.base| .cse45) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse44 (select (select .cse44 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)))))) (or .cse14 .cse46) (or .cse2 (and .cse37 .cse47 .cse46)) .cse47 (or .cse9 (and .cse37 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_105 Int) (v_arrayElimCell_108 Int)) (or (= (select |c_#valid| (select (let ((.cse48 (store (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse49 (store (select |c_#memory_$Pointer$.base| .cse49) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse48 (select (select .cse48 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_108 4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse50 (store (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (select |c_#memory_$Pointer$.base| .cse51) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse50 (select (select .cse50 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)))))) (or .cse5 (and .cse36 .cse40 .cse41 .cse47)))))) (.cse1 (or .cse14 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (= (select |c_#valid| (select (let ((.cse34 (store (let ((.cse35 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse35 (store (select |c_#memory_$Pointer$.base| .cse35) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse34 (select (select .cse34 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_108 4))) 1)))) (.cse6 (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (= (select |c_#valid| (let ((.cse33 (+ v_arrayElimCell_106 4))) (select (let ((.cse31 (store (let ((.cse32 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse32 (store (select |c_#memory_$Pointer$.base| .cse32) .cse33 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse31 (select (select .cse31 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) .cse33))) 1)) .cse2)) (.cse7 (or .cse9 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (let ((.cse28 (let ((.cse29 (store (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse30 (store (select |c_#memory_$Pointer$.base| .cse30) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse29 (select (select .cse29 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse28 (+ v_arrayElimCell_107 4))) 1) (= (select |c_#valid| (select .cse28 (+ v_arrayElimCell_108 4))) 1)))))) (.cse8 (or .cse3 .cse2)) (.cse4 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse25 (+ v_arrayElimCell_106 4))) (let ((.cse24 (let ((.cse26 (store (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse27 (store (select |c_#memory_$Pointer$.base| .cse27) .cse25 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse26 (select (select .cse26 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse22 (store (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse23 (store (select |c_#memory_$Pointer$.base| .cse23) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse22 (select (select .cse22 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (select .cse24 .cse25)) 1) (= (select |c_#valid| (select .cse24 (+ v_arrayElimCell_108 4))) 1))))))) (and (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_~#slot~0.base|) .cse0) .cse1 (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) .cse0) (or .cse2 (and .cse3 .cse1 .cse4)) (or .cse5 (and .cse6 .cse7 .cse8 .cse4)) (or .cse9 (and .cse1 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse10 (store (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse11 (store (select |c_#memory_$Pointer$.base| .cse11) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse10 (select (select .cse10 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (select (let ((.cse12 (store (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse12 (select (select .cse12 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_108 4))) 1))))) (or .cse3 .cse14) .cse8 (or .cse5 (and .cse6 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse15 (store (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse16 (store (select |c_#memory_$Pointer$.base| .cse16) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse15 (select (select .cse15 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (let ((.cse19 (+ v_arrayElimCell_106 4))) (select (let ((.cse17 (store (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse18 (store (select |c_#memory_$Pointer$.base| .cse18) .cse19 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse17 (select (select .cse17 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) .cse19))) 1))) .cse7 .cse8 (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse20 (store (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse21 (store (select |c_#memory_$Pointer$.base| .cse21) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse20 (select (select .cse20 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)) .cse9))) .cse4)))) is different from false [2022-10-03 12:26:55,884 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_main_#t~ret42#1.base| |c_~#slot~0.base|)) (.cse2 (= |c_~#slot~0.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|)))) (let ((.cse3 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse68 (+ v_arrayElimCell_106 4))) (let ((.cse67 (let ((.cse69 (store (let ((.cse70 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse70 (store (select |c_#memory_$Pointer$.base| .cse70) .cse68 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse69 (select (select .cse69 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse67 .cse68)) 1) (= (select |c_#valid| (select .cse67 (+ v_arrayElimCell_108 4))) 1)))))) (.cse9 (not .cse2)) (.cse14 (not .cse5))) (let ((.cse0 (let ((.cse46 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int) (v_arrayElimCell_108 Int)) (let ((.cse64 (let ((.cse65 (store (let ((.cse66 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse66 (store (select |c_#memory_$Pointer$.base| .cse66) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse65 (select (select .cse65 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse64 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse64 (+ v_arrayElimCell_106 4))) 1)))))) (let ((.cse37 (or .cse14 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_105 Int) (v_arrayElimCell_108 Int)) (= (select |c_#valid| (select (let ((.cse62 (store (let ((.cse63 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse63 (store (select |c_#memory_$Pointer$.base| .cse63) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse62 (select (select .cse62 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_108 4))) 1)))) (.cse36 (or .cse2 .cse46)) (.cse40 (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int)) (= (select |c_#valid| (select (let ((.cse60 (store (let ((.cse61 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse61 (store (select |c_#memory_$Pointer$.base| .cse61) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse60 (select (select .cse60 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_106 4))) 1)) .cse2)) (.cse41 (or .cse9 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_105 Int) (v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (let ((.cse57 (let ((.cse58 (store (let ((.cse59 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse59 (store (select |c_#memory_$Pointer$.base| .cse59) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse58 (select (select .cse58 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse57 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse57 (+ v_arrayElimCell_107 4))) 1)))))) (.cse47 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int) (v_arrayElimCell_108 Int)) (let ((.cse52 (let ((.cse55 (store (let ((.cse56 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse56 (store (select |c_#memory_$Pointer$.base| .cse56) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse55 (select (select .cse55 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse52 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse52 (+ v_arrayElimCell_106 4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse53 (store (let ((.cse54 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse54 (store (select |c_#memory_$Pointer$.base| .cse54) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse53 (select (select .cse53 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1))))))) (and .cse36 .cse37 (or .cse5 (and (or .cse9 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_105 Int) (v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse38 (store (let ((.cse39 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse39 (store (select |c_#memory_$Pointer$.base| .cse39) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse38 (select (select .cse38 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1))) .cse36 .cse40 .cse41 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_105 Int)) (or (= (select |c_#valid| (select (let ((.cse42 (store (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse43 (store (select |c_#memory_$Pointer$.base| .cse43) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse42 (select (select .cse42 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_106 4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse44 (store (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse45 (store (select |c_#memory_$Pointer$.base| .cse45) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse44 (select (select .cse44 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)))))) (or .cse14 .cse46) (or .cse2 (and .cse37 .cse47 .cse46)) .cse47 (or .cse9 (and .cse37 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_105 Int) (v_arrayElimCell_108 Int)) (or (= (select |c_#valid| (select (let ((.cse48 (store (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse49 (store (select |c_#memory_$Pointer$.base| .cse49) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse48 (select (select .cse48 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_108 4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse50 (store (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (select |c_#memory_$Pointer$.base| .cse51) (+ v_arrayElimCell_105 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse50 (select (select .cse50 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)))))) (or .cse5 (and .cse36 .cse40 .cse41 .cse47)))))) (.cse1 (or .cse14 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (= (select |c_#valid| (select (let ((.cse34 (store (let ((.cse35 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse35 (store (select |c_#memory_$Pointer$.base| .cse35) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse34 (select (select .cse34 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_108 4))) 1)))) (.cse6 (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (= (select |c_#valid| (let ((.cse33 (+ v_arrayElimCell_106 4))) (select (let ((.cse31 (store (let ((.cse32 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse32 (store (select |c_#memory_$Pointer$.base| .cse32) .cse33 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse31 (select (select .cse31 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) .cse33))) 1)) .cse2)) (.cse7 (or .cse9 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (let ((.cse28 (let ((.cse29 (store (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse30 (store (select |c_#memory_$Pointer$.base| .cse30) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse29 (select (select .cse29 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse28 (+ v_arrayElimCell_107 4))) 1) (= (select |c_#valid| (select .cse28 (+ v_arrayElimCell_108 4))) 1)))))) (.cse8 (or .cse3 .cse2)) (.cse4 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse25 (+ v_arrayElimCell_106 4))) (let ((.cse24 (let ((.cse26 (store (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse27 (store (select |c_#memory_$Pointer$.base| .cse27) .cse25 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse26 (select (select .cse26 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse22 (store (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse23 (store (select |c_#memory_$Pointer$.base| .cse23) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse22 (select (select .cse22 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (select .cse24 .cse25)) 1) (= (select |c_#valid| (select .cse24 (+ v_arrayElimCell_108 4))) 1))))))) (and (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_~#slot~0.base|) .cse0) .cse1 (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) .cse0) (or .cse2 (and .cse3 .cse1 .cse4)) (or .cse5 (and .cse6 .cse7 .cse8 .cse4)) (or .cse9 (and .cse1 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse10 (store (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse11 (store (select |c_#memory_$Pointer$.base| .cse11) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse10 (select (select .cse10 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (select (let ((.cse12 (store (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse12 (select (select .cse12 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_108 4))) 1))))) (or .cse3 .cse14) .cse8 (or .cse5 (and .cse6 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse15 (store (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse16 (store (select |c_#memory_$Pointer$.base| .cse16) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse15 (select (select .cse15 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (let ((.cse19 (+ v_arrayElimCell_106 4))) (select (let ((.cse17 (store (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse18 (store (select |c_#memory_$Pointer$.base| .cse18) .cse19 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse17 (select (select .cse17 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) .cse19))) 1))) .cse7 .cse8 (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse20 (store (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base|) |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset|))) (store |c_#memory_$Pointer$.base| .cse21 (store (select |c_#memory_$Pointer$.base| .cse21) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse20 (select (select .cse20 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ v_arrayElimCell_107 4))) 1)) .cse9))) .cse4)))) is different from true [2022-10-03 12:26:57,317 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse25 (= |c_~#slot~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (.cse18 (= |c_ULTIMATE.start_main_#t~ret42#1.base| |c_~#slot~0.base|))) (let ((.cse2 (not .cse18)) (.cse5 (not .cse25)) (.cse3 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse46 (+ v_arrayElimCell_106 4))) (let ((.cse45 (let ((.cse48 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse47 (store (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse48))) (store |c_#memory_$Pointer$.base| .cse49 (store (select |c_#memory_$Pointer$.base| .cse49) .cse46 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse47 (select (select .cse47 |c_~#slot~0.base|) .cse48)))))) (or (= (select |c_#valid| (select .cse45 .cse46)) 1) (= (select |c_#valid| (select .cse45 (+ v_arrayElimCell_108 4))) 1))))))) (let ((.cse0 (or .cse25 .cse3)) (.cse9 (or .cse25 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (= (select |c_#valid| (let ((.cse44 (+ v_arrayElimCell_106 4))) (select (let ((.cse42 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse41 (store (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse42))) (store |c_#memory_$Pointer$.base| .cse43 (store (select |c_#memory_$Pointer$.base| .cse43) .cse44 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse41 (select (select .cse41 |c_~#slot~0.base|) .cse42)))) .cse44))) 1)))) (.cse10 (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (let ((.cse37 (let ((.cse39 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse38 (store (let ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse39))) (store |c_#memory_$Pointer$.base| .cse40 (store (select |c_#memory_$Pointer$.base| .cse40) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse38 (select (select .cse38 |c_~#slot~0.base|) .cse39)))))) (or (= (select |c_#valid| (select .cse37 (+ v_arrayElimCell_107 4))) 1) (= (select |c_#valid| (select .cse37 (+ v_arrayElimCell_108 4))) 1)))) .cse5)) (.cse1 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse33 (+ v_arrayElimCell_106 4))) (let ((.cse32 (let ((.cse35 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse34 (store (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse35))) (store |c_#memory_$Pointer$.base| .cse36 (store (select |c_#memory_$Pointer$.base| .cse36) .cse33 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse34 (select (select .cse34 |c_~#slot~0.base|) .cse35)))))) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse30 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse29 (store (let ((.cse31 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse30))) (store |c_#memory_$Pointer$.base| .cse31 (store (select |c_#memory_$Pointer$.base| .cse31) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse29 (select (select .cse29 |c_~#slot~0.base|) .cse30)))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (select .cse32 .cse33)) 1) (= (select |c_#valid| (select .cse32 (+ v_arrayElimCell_108 4))) 1)))))) (.cse4 (or .cse2 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (= (select |c_#valid| (select (let ((.cse27 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse26 (store (let ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse27))) (store |c_#memory_$Pointer$.base| .cse28 (store (select |c_#memory_$Pointer$.base| .cse28) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse26 (select (select .cse26 |c_~#slot~0.base|) .cse27)))) (+ v_arrayElimCell_108 4))) 1))))) (and .cse0 .cse1 (or .cse2 .cse3) .cse4 (or (and .cse0 (or .cse5 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse7 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse6 (store (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse7))) (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse6 (select (select .cse6 |c_~#slot~0.base|) .cse7)))) (+ v_arrayElimCell_107 4))) 1))) .cse9 .cse10 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse12 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse11 (store (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse12))) (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse11 (select (select .cse11 |c_~#slot~0.base|) .cse12)))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (let ((.cse17 (+ v_arrayElimCell_106 4))) (select (let ((.cse15 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse14 (store (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse15))) (store |c_#memory_$Pointer$.base| .cse16 (store (select |c_#memory_$Pointer$.base| .cse16) .cse17 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse14 (select (select .cse14 |c_~#slot~0.base|) .cse15)))) .cse17))) 1)))) .cse18) (or (and .cse0 .cse9 .cse1 .cse10) .cse18) (or .cse5 (and .cse4 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse20 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse19 (store (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse20))) (store |c_#memory_$Pointer$.base| .cse21 (store (select |c_#memory_$Pointer$.base| .cse21) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse19 (select (select .cse19 |c_~#slot~0.base|) .cse20)))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (select (let ((.cse23 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse22 (store (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse23))) (store |c_#memory_$Pointer$.base| .cse24 (store (select |c_#memory_$Pointer$.base| .cse24) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1373))) (select .cse22 (select (select .cse22 |c_~#slot~0.base|) .cse23)))) (+ v_arrayElimCell_108 4))) 1))))) (or (and .cse1 .cse4 .cse3) .cse25))))) is different from false [2022-10-03 12:26:57,874 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (= |c_~#slot~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (.cse0 (= |c_~#slot~0.base| |c_ULTIMATE.start_new_#res#1.base|))) (let ((.cse25 (not .cse0)) (.cse24 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse46 (+ v_arrayElimCell_106 4))) (let ((.cse45 (let ((.cse48 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse47 (store (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse48))) (store |c_#memory_$Pointer$.base| .cse49 (store (select |c_#memory_$Pointer$.base| .cse49) .cse46 |c_ULTIMATE.start_new_#res#1.base|))) |c_ULTIMATE.start_new_#res#1.base| v_ArrVal_1373))) (select .cse47 (select (select .cse47 |c_~#slot~0.base|) .cse48)))))) (or (= (select |c_#valid| (select .cse45 .cse46)) 1) (= (select |c_#valid| (select .cse45 (+ v_arrayElimCell_108 4))) 1)))))) (.cse12 (not .cse23))) (let ((.cse13 (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (= (select |c_#valid| (let ((.cse44 (+ v_arrayElimCell_106 4))) (select (let ((.cse42 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse41 (store (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse42))) (store |c_#memory_$Pointer$.base| .cse43 (store (select |c_#memory_$Pointer$.base| .cse43) .cse44 |c_ULTIMATE.start_new_#res#1.base|))) |c_ULTIMATE.start_new_#res#1.base| v_ArrVal_1373))) (select .cse41 (select (select .cse41 |c_~#slot~0.base|) .cse42)))) .cse44))) 1)) .cse23)) (.cse14 (or .cse12 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (let ((.cse37 (let ((.cse39 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse38 (store (let ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse39))) (store |c_#memory_$Pointer$.base| .cse40 (store (select |c_#memory_$Pointer$.base| .cse40) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_#res#1.base|))) |c_ULTIMATE.start_new_#res#1.base| v_ArrVal_1373))) (select .cse38 (select (select .cse38 |c_~#slot~0.base|) .cse39)))))) (or (= (select |c_#valid| (select .cse37 (+ v_arrayElimCell_107 4))) 1) (= (select |c_#valid| (select .cse37 (+ v_arrayElimCell_108 4))) 1)))))) (.cse8 (or .cse24 .cse23)) (.cse15 (or .cse25 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (= (select |c_#valid| (select (let ((.cse35 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse34 (store (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse35))) (store |c_#memory_$Pointer$.base| .cse36 (store (select |c_#memory_$Pointer$.base| .cse36) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_#res#1.base|))) |c_ULTIMATE.start_new_#res#1.base| v_ArrVal_1373))) (select .cse34 (select (select .cse34 |c_~#slot~0.base|) .cse35)))) (+ v_arrayElimCell_108 4))) 1)))) (.cse16 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse27 (+ v_arrayElimCell_106 4))) (let ((.cse26 (let ((.cse32 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse31 (store (let ((.cse33 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse32))) (store |c_#memory_$Pointer$.base| .cse33 (store (select |c_#memory_$Pointer$.base| .cse33) .cse27 |c_ULTIMATE.start_new_#res#1.base|))) |c_ULTIMATE.start_new_#res#1.base| v_ArrVal_1373))) (select .cse31 (select (select .cse31 |c_~#slot~0.base|) .cse32)))))) (or (= (select |c_#valid| (select .cse26 .cse27)) 1) (= (select |c_#valid| (select .cse26 (+ v_arrayElimCell_108 4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse29 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse28 (store (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse29))) (store |c_#memory_$Pointer$.base| .cse30 (store (select |c_#memory_$Pointer$.base| .cse30) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_#res#1.base|))) |c_ULTIMATE.start_new_#res#1.base| v_ArrVal_1373))) (select .cse28 (select (select .cse28 |c_~#slot~0.base|) .cse29)))) (+ v_arrayElimCell_107 4))) 1)))))))) (and (or .cse0 (and (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (or (= (select |c_#valid| (let ((.cse4 (+ v_arrayElimCell_106 4))) (select (let ((.cse2 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse1 (store (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse2))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 |c_ULTIMATE.start_new_#res#1.base|))) |c_ULTIMATE.start_new_#res#1.base| v_ArrVal_1373))) (select .cse1 (select (select .cse1 |c_~#slot~0.base|) .cse2)))) .cse4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse6 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse5 (store (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse6))) (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_#res#1.base|))) |c_ULTIMATE.start_new_#res#1.base| v_ArrVal_1373))) (select .cse5 (select (select .cse5 |c_~#slot~0.base|) .cse6)))) (+ v_arrayElimCell_107 4))) 1)))) .cse8 (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse10 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse9 (store (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse10))) (store |c_#memory_$Pointer$.base| .cse11 (store (select |c_#memory_$Pointer$.base| .cse11) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_#res#1.base|))) |c_ULTIMATE.start_new_#res#1.base| v_ArrVal_1373))) (select .cse9 (select (select .cse9 |c_~#slot~0.base|) .cse10)))) (+ v_arrayElimCell_107 4))) 1)) .cse12) .cse13 .cse14)) .cse15 (or .cse0 (and .cse8 .cse13 .cse16 .cse14)) .cse8 (or .cse12 (and .cse15 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (or (= (select |c_#valid| (select (let ((.cse18 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse17 (store (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse18))) (store |c_#memory_$Pointer$.base| .cse19 (store (select |c_#memory_$Pointer$.base| .cse19) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_#res#1.base|))) |c_ULTIMATE.start_new_#res#1.base| v_ArrVal_1373))) (select .cse17 (select (select .cse17 |c_~#slot~0.base|) .cse18)))) (+ v_arrayElimCell_108 4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse21 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse20 (store (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse21))) (store |c_#memory_$Pointer$.base| .cse22 (store (select |c_#memory_$Pointer$.base| .cse22) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_#res#1.base|))) |c_ULTIMATE.start_new_#res#1.base| v_ArrVal_1373))) (select .cse20 (select (select .cse20 |c_~#slot~0.base|) .cse21)))) (+ v_arrayElimCell_107 4))) 1)))))) .cse16 (or .cse23 (and .cse15 .cse24 .cse16)) (or .cse25 .cse24))))) is different from false [2022-10-03 12:26:58,034 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#slot~0.base| |c_ULTIMATE.start_new_~p~0#1.base|)) (.cse23 (= |c_~#slot~0.base| (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) (let ((.cse24 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse46 (+ v_arrayElimCell_106 4))) (let ((.cse45 (let ((.cse48 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse47 (store (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse48))) (store |c_#memory_$Pointer$.base| .cse49 (store (select |c_#memory_$Pointer$.base| .cse49) .cse46 |c_ULTIMATE.start_new_~p~0#1.base|))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse47 (select (select .cse47 |c_~#slot~0.base|) .cse48)))))) (or (= (select |c_#valid| (select .cse45 .cse46)) 1) (= (select |c_#valid| (select .cse45 (+ v_arrayElimCell_108 4))) 1)))))) (.cse11 (not .cse23)) (.cse25 (not .cse0))) (let ((.cse15 (or .cse25 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (= (select |c_#valid| (select (let ((.cse43 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse42 (store (let ((.cse44 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse43))) (store |c_#memory_$Pointer$.base| .cse44 (store (select |c_#memory_$Pointer$.base| .cse44) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse42 (select (select .cse42 |c_~#slot~0.base|) .cse43)))) (+ v_arrayElimCell_108 4))) 1)))) (.cse1 (or .cse11 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (let ((.cse38 (let ((.cse40 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse39 (store (let ((.cse41 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse40))) (store |c_#memory_$Pointer$.base| .cse41 (store (select |c_#memory_$Pointer$.base| .cse41) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse39 (select (select .cse39 |c_~#slot~0.base|) .cse40)))))) (or (= (select |c_#valid| (select .cse38 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse38 (+ v_arrayElimCell_107 4))) 1)))))) (.cse2 (or .cse24 .cse23)) (.cse22 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse34 (+ v_arrayElimCell_106 4))) (let ((.cse33 (let ((.cse36 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse35 (store (let ((.cse37 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse36))) (store |c_#memory_$Pointer$.base| .cse37 (store (select |c_#memory_$Pointer$.base| .cse37) .cse34 |c_ULTIMATE.start_new_~p~0#1.base|))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse35 (select (select .cse35 |c_~#slot~0.base|) .cse36)))))) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse31 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse30 (store (let ((.cse32 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse31))) (store |c_#memory_$Pointer$.base| .cse32 (store (select |c_#memory_$Pointer$.base| .cse32) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse30 (select (select .cse30 |c_~#slot~0.base|) .cse31)))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (select .cse33 .cse34)) 1) (= (select |c_#valid| (select .cse33 (+ v_arrayElimCell_108 4))) 1)))))) (.cse10 (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (= (select |c_#valid| (let ((.cse29 (+ v_arrayElimCell_106 4))) (select (let ((.cse27 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse26 (store (let ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse27))) (store |c_#memory_$Pointer$.base| .cse28 (store (select |c_#memory_$Pointer$.base| .cse28) .cse29 |c_ULTIMATE.start_new_~p~0#1.base|))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse26 (select (select .cse26 |c_~#slot~0.base|) .cse27)))) .cse29))) 1)) .cse23))) (and (or .cse0 (and .cse1 .cse2 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse4 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse3 (store (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse4))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse3 (select (select .cse3 |c_~#slot~0.base|) .cse4)))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (let ((.cse9 (+ v_arrayElimCell_106 4))) (select (let ((.cse7 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse6 (store (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse7))) (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) .cse9 |c_ULTIMATE.start_new_~p~0#1.base|))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse6 (select (select .cse6 |c_~#slot~0.base|) .cse7)))) .cse9))) 1))) .cse10 (or .cse11 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse13 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse12 (store (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse13))) (store |c_#memory_$Pointer$.base| .cse14 (store (select |c_#memory_$Pointer$.base| .cse14) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse12 (select (select .cse12 |c_~#slot~0.base|) .cse13)))) (+ v_arrayElimCell_107 4))) 1))))) (or .cse11 (and .cse15 (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse17 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse16 (store (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse17))) (store |c_#memory_$Pointer$.base| .cse18 (store (select |c_#memory_$Pointer$.base| .cse18) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse16 (select (select .cse16 |c_~#slot~0.base|) .cse17)))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (select (let ((.cse20 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse19 (store (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse20))) (store |c_#memory_$Pointer$.base| .cse21 (store (select |c_#memory_$Pointer$.base| .cse21) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse19 (select (select .cse19 |c_~#slot~0.base|) .cse20)))) (+ v_arrayElimCell_108 4))) 1))))) .cse2 .cse15 .cse22 (or .cse23 (and .cse24 .cse15 .cse22)) (or .cse0 (and .cse1 .cse2 .cse22 .cse10)) (or .cse24 .cse25))))) is different from false [2022-10-03 12:26:58,342 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#slot~0.base| |c_ULTIMATE.start_new_~p~0#1.base|))) (let ((.cse1 (forall ((v_ArrVal_1369 (Array Int Int))) (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (= (select |c_#valid| (let ((.cse80 (+ v_arrayElimCell_106 4))) (select (let ((.cse77 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse76 (store (let ((.cse78 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse79 (select (select .cse78 |c_~#slot~0.base|) .cse77))) (store .cse78 .cse79 (store (select .cse78 .cse79) .cse80 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse76 (select (select .cse76 |c_~#slot~0.base|) .cse77)))) .cse80))) 1)) (= (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |c_~#slot~0.base|)))) (.cse2 (forall ((v_ArrVal_1369 (Array Int Int))) (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (let ((.cse71 (let ((.cse73 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse72 (store (let ((.cse74 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse75 (select (select .cse74 |c_~#slot~0.base|) .cse73))) (store .cse74 .cse75 (store (select .cse74 .cse75) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse72 (select (select .cse72 |c_~#slot~0.base|) .cse73)))))) (or (= (select |c_#valid| (select .cse71 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse71 (+ v_arrayElimCell_107 4))) 1)))) (not (= (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |c_~#slot~0.base|))))) (.cse3 (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse62 (+ v_arrayElimCell_106 4))) (let ((.cse61 (let ((.cse68 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse67 (store (let ((.cse69 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse70 (select (select .cse69 |c_~#slot~0.base|) .cse68))) (store .cse69 .cse70 (store (select .cse69 .cse70) .cse62 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse67 (select (select .cse67 |c_~#slot~0.base|) .cse68)))))) (or (= (select |c_#valid| (select .cse61 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse61 .cse62)) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse64 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse63 (store (let ((.cse65 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse66 (select (select .cse65 |c_~#slot~0.base|) .cse64))) (store .cse65 .cse66 (store (select .cse65 .cse66) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse63 (select (select .cse63 |c_~#slot~0.base|) .cse64)))) (+ v_arrayElimCell_107 4))) 1))))))) (.cse4 (forall ((v_ArrVal_1369 (Array Int Int))) (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse56 (+ v_arrayElimCell_106 4))) (let ((.cse55 (let ((.cse58 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse57 (store (let ((.cse59 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse60 (select (select .cse59 |c_~#slot~0.base|) .cse58))) (store .cse59 .cse60 (store (select .cse59 .cse60) .cse56 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse57 (select (select .cse57 |c_~#slot~0.base|) .cse58)))))) (or (= (select |c_#valid| (select .cse55 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse55 .cse56)) 1))))) (= (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |c_~#slot~0.base|)))) (.cse15 (not .cse0))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4)) (forall ((v_ArrVal_1369 (Array Int Int))) (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse6 (+ v_arrayElimCell_106 4))) (let ((.cse5 (let ((.cse12 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse11 (store (let ((.cse13 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse14 (select (select .cse13 |c_~#slot~0.base|) .cse12))) (store .cse13 .cse14 (store (select .cse13 .cse14) .cse6 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse11 (select (select .cse11 |c_~#slot~0.base|) .cse12)))))) (or (= (select |c_#valid| (select .cse5 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse5 .cse6)) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse8 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse7 (store (let ((.cse9 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse10 (select (select .cse9 |c_~#slot~0.base|) .cse8))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse7 (select (select .cse7 |c_~#slot~0.base|) .cse8)))) (+ v_arrayElimCell_107 4))) 1)))))) (= (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |c_~#slot~0.base|))) (or .cse15 (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse18 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369)) (.cse17 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse19 (select (select .cse18 |c_~#slot~0.base|) .cse17))) (or (= (select |c_#valid| (select (let ((.cse16 (store (store .cse18 .cse19 (store (select .cse18 .cse19) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse16 (select (select .cse16 |c_~#slot~0.base|) .cse17))) (+ v_arrayElimCell_108 4))) 1) (= .cse19 |c_~#slot~0.base|)))))) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (= (select |c_#valid| (select (let ((.cse21 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse20 (store (let ((.cse22 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse23 (select (select .cse22 |c_~#slot~0.base|) .cse21))) (store .cse22 .cse23 (store (select .cse22 .cse23) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse20 (select (select .cse20 |c_~#slot~0.base|) .cse21)))) (+ v_arrayElimCell_108 4))) 1)) .cse15) (or .cse0 (and (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int)) (or (= (select |c_#valid| (let ((.cse28 (+ v_arrayElimCell_106 4))) (select (let ((.cse25 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse24 (store (let ((.cse26 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse27 (select (select .cse26 |c_~#slot~0.base|) .cse25))) (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse24 (select (select .cse24 |c_~#slot~0.base|) .cse25)))) .cse28))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse30 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse29 (store (let ((.cse31 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse32 (select (select .cse31 |c_~#slot~0.base|) .cse30))) (store .cse31 .cse32 (store (select .cse31 .cse32) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse29 (select (select .cse29 |c_~#slot~0.base|) .cse30)))) (+ v_arrayElimCell_107 4))) 1)))) (forall ((v_ArrVal_1369 (Array Int Int))) (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse34 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse33 (store (let ((.cse35 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse36 (select (select .cse35 |c_~#slot~0.base|) .cse34))) (store .cse35 .cse36 (store (select .cse35 .cse36) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse33 (select (select .cse33 |c_~#slot~0.base|) .cse34)))) (+ v_arrayElimCell_107 4))) 1)) (not (= (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |c_~#slot~0.base|)))) .cse1 .cse2 .cse4)) (forall ((v_ArrVal_1369 (Array Int Int))) (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (or (= (select |c_#valid| (select (let ((.cse38 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse37 (store (let ((.cse39 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse40 (select (select .cse39 |c_~#slot~0.base|) .cse38))) (store .cse39 .cse40 (store (select .cse39 .cse40) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse37 (select (select .cse37 |c_~#slot~0.base|) .cse38)))) (+ v_arrayElimCell_108 4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse42 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse41 (store (let ((.cse43 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse44 (select (select .cse43 |c_~#slot~0.base|) .cse42))) (store .cse43 .cse44 (store (select .cse43 .cse44) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse41 (select (select .cse41 |c_~#slot~0.base|) .cse42)))) (+ v_arrayElimCell_107 4))) 1)))) (not (= (select (select (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |c_~#slot~0.base|)))) (or (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse46 (+ v_arrayElimCell_106 4))) (let ((.cse45 (let ((.cse48 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse47 (store (let ((.cse49 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369))) (let ((.cse50 (select (select .cse49 |c_~#slot~0.base|) .cse48))) (store .cse49 .cse50 (store (select .cse49 .cse50) .cse46 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse47 (select (select .cse47 |c_~#slot~0.base|) .cse48)))))) (or (= (select |c_#valid| (select .cse45 (+ v_arrayElimCell_108 4))) 1) (= (select |c_#valid| (select .cse45 .cse46)) 1))))) .cse15) .cse3 .cse4 (or .cse15 (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse53 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1369)) (.cse52 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse54 (select (select .cse53 |c_~#slot~0.base|) .cse52))) (or (= (select |c_#valid| (select (let ((.cse51 (store (store .cse53 .cse54 (store (select .cse53 .cse54) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse51 (select (select .cse51 |c_~#slot~0.base|) .cse52))) (+ v_arrayElimCell_108 4))) 1) (not (= .cse54 |c_~#slot~0.base|)))))))))) is different from false [2022-10-03 12:27:21,044 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 82 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-03 12:27:21,117 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#slot~0.base| |c_ULTIMATE.start_new_~p~0#1.base|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369)) (.cse2 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse0 (select (select .cse3 |c_~#slot~0.base|) .cse2))) (or (= |c_~#slot~0.base| .cse0) (= (select |c_#valid| (select (let ((.cse1 (store (store .cse3 .cse0 (store (select .cse3 .cse0) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse1 (select (select .cse1 |c_~#slot~0.base|) .cse2))) (+ v_arrayElimCell_108 4))) 1)))))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369)) (.cse6 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse4 (select (select .cse7 |c_~#slot~0.base|) .cse6))) (or (not (= |c_~#slot~0.base| .cse4)) (= (select |c_#valid| (select (let ((.cse5 (store (store .cse7 .cse4 (store (select .cse7 .cse4) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse5 (select (select .cse5 |c_~#slot~0.base|) .cse6))) (+ v_arrayElimCell_108 4))) 1))))) (forall ((v_ArrVal_1369 (Array Int Int))) (or (not (= |c_~#slot~0.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (or (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse9 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse8 (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369))) (let ((.cse11 (select (select .cse10 |c_~#slot~0.base|) .cse9))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse8 (select (select .cse8 |c_~#slot~0.base|) .cse9)))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (select (let ((.cse13 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse12 (store (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369))) (let ((.cse15 (select (select .cse14 |c_~#slot~0.base|) .cse13))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse12 (select (select .cse12 |c_~#slot~0.base|) .cse13)))) (+ v_arrayElimCell_108 4))) 1))))) (forall ((v_ArrVal_1369 (Array Int Int))) (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse17 (+ v_arrayElimCell_106 4))) (let ((.cse16 (let ((.cse23 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse22 (store (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369))) (let ((.cse25 (select (select .cse24 |c_~#slot~0.base|) .cse23))) (store .cse24 .cse25 (store (select .cse24 .cse25) .cse17 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse22 (select (select .cse22 |c_~#slot~0.base|) .cse23)))))) (or (= (select |c_#valid| (select .cse16 .cse17)) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse19 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse18 (store (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369))) (let ((.cse21 (select (select .cse20 |c_~#slot~0.base|) .cse19))) (store .cse20 .cse21 (store (select .cse20 .cse21) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse18 (select (select .cse18 |c_~#slot~0.base|) .cse19)))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (select .cse16 (+ v_arrayElimCell_108 4))) 1))))) (= |c_~#slot~0.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) is different from false [2022-10-03 12:27:21,199 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1368 (Array Int Int))) (or (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse5 (+ v_arrayElimCell_106 4))) (let ((.cse0 (let ((.cse7 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse6 (store (let ((.cse8 (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1368) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369))) (let ((.cse9 (select (select .cse8 |c_~#slot~0.base|) .cse7))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse5 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse6 (select (select .cse6 |c_~#slot~0.base|) .cse7)))))) (or (= (select |c_#valid| (select .cse0 (+ v_arrayElimCell_108 4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse2 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse1 (store (let ((.cse3 (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1368) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369))) (let ((.cse4 (select (select .cse3 |c_~#slot~0.base|) .cse2))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse1 (select (select .cse1 |c_~#slot~0.base|) .cse2)))) (+ v_arrayElimCell_107 4))) 1)) (= (select |c_#valid| (select .cse0 .cse5)) 1))))) (= |c_~#slot~0.base| (select (select (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1368) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1368 (Array Int Int))) (or (not (= |c_~#slot~0.base| (select (select (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1368) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (forall ((v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (or (= (select |c_#valid| (select (let ((.cse11 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse10 (store (let ((.cse12 (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1368) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369))) (let ((.cse13 (select (select .cse12 |c_~#slot~0.base|) .cse11))) (store .cse12 .cse13 (store (select .cse12 .cse13) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse10 (select (select .cse10 |c_~#slot~0.base|) .cse11)))) (+ v_arrayElimCell_108 4))) 1) (forall ((v_arrayElimCell_107 Int)) (= (select |c_#valid| (select (let ((.cse15 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse14 (store (let ((.cse16 (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1368) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369))) (let ((.cse17 (select (select .cse16 |c_~#slot~0.base|) .cse15))) (store .cse16 .cse17 (store (select .cse16 .cse17) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse14 (select (select .cse14 |c_~#slot~0.base|) .cse15)))) (+ v_arrayElimCell_107 4))) 1)))))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse20 (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1368) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369)) (.cse19 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse21 (select (select .cse20 |c_~#slot~0.base|) .cse19))) (or (= (select |c_#valid| (select (let ((.cse18 (store (store .cse20 .cse21 (store (select .cse20 .cse21) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse18 (select (select .cse18 |c_~#slot~0.base|) .cse19))) (+ v_arrayElimCell_108 4))) 1) (not (= |c_~#slot~0.base| .cse21)))))) (or (not (= |c_~#slot~0.base| |c_ULTIMATE.start_new_~p~0#1.base|)) (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_108 Int)) (let ((.cse24 (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1368) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1369)) (.cse23 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse25 (select (select .cse24 |c_~#slot~0.base|) .cse23))) (or (= (select |c_#valid| (select (let ((.cse22 (store (store .cse24 .cse25 (store (select .cse24 .cse25) (+ v_arrayElimCell_106 4) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1373))) (select .cse22 (select (select .cse22 |c_~#slot~0.base|) .cse23))) (+ v_arrayElimCell_108 4))) 1) (= |c_~#slot~0.base| .cse25))))))) is different from false [2022-10-03 12:27:21,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 12:27:21,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 961 treesize of output 6209 Received shutdown request... [2022-10-03 12:37:07,538 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 12:37:07,538 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 [2022-10-03 12:37:07,548 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-10-03 12:37:07,559 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-03 12:37:07,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-03 12:37:07,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:37:07,765 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 721 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 11 xjuncts wrt. a ATOM-1 context. [2022-10-03 12:37:07,768 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-10-03 12:37:07,769 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT was TIMEOUT (1/2) [2022-10-03 12:37:07,771 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-03 12:37:07,771 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-03 12:37:07,773 INFO L202 PluginConnector]: Adding new model 09-regions_16-arrayloop_rc.line762.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 12:37:07 BasicIcfg [2022-10-03 12:37:07,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-03 12:37:07,776 INFO L158 Benchmark]: Toolchain (without parser) took 830909.74ms. Allocated memory was 182.5MB in the beginning and 483.4MB in the end (delta: 300.9MB). Free memory was 132.7MB in the beginning and 308.4MB in the end (delta: -175.7MB). Peak memory consumption was 384.0MB. Max. memory is 8.0GB. [2022-10-03 12:37:07,776 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 12:37:07,776 INFO L158 Benchmark]: Boogie Preprocessor took 63.21ms. Allocated memory is still 182.5MB. Free memory was 132.7MB in the beginning and 129.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-03 12:37:07,777 INFO L158 Benchmark]: RCFGBuilder took 542.62ms. Allocated memory was 182.5MB in the beginning and 261.1MB in the end (delta: 78.6MB). Free memory was 129.3MB in the beginning and 214.1MB in the end (delta: -84.8MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2022-10-03 12:37:07,777 INFO L158 Benchmark]: TraceAbstraction took 830299.33ms. Allocated memory was 261.1MB in the beginning and 483.4MB in the end (delta: 222.3MB). Free memory was 213.6MB in the beginning and 308.4MB in the end (delta: -94.8MB). Peak memory consumption was 384.7MB. Max. memory is 8.0GB. [2022-10-03 12:37:07,779 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 135.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 63.21ms. Allocated memory is still 182.5MB. Free memory was 132.7MB in the beginning and 129.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 542.62ms. Allocated memory was 182.5MB in the beginning and 261.1MB in the end (delta: 78.6MB). Free memory was 129.3MB in the beginning and 214.1MB in the end (delta: -84.8MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. * TraceAbstraction took 830299.33ms. Allocated memory was 261.1MB in the beginning and 483.4MB in the end (delta: 222.3MB). Free memory was 213.6MB in the beginning and 308.4MB in the end (delta: -94.8MB). Peak memory consumption was 384.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 126, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 809, positive: 720, positive conditional: 720, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 720, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 126, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 720, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 126, unknown conditional: 0, unknown unconditional: 126] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 6, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 124, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 809, positive: 720, positive conditional: 720, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 720, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 126, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 720, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 126, unknown conditional: 0, unknown unconditional: 126] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 127, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 809, positive: 720, positive conditional: 720, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 720, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 126, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 720, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 126, unknown conditional: 0, unknown unconditional: 126] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 17, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 133, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 809, positive: 720, positive conditional: 720, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 720, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 126, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 720, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 126, unknown conditional: 0, unknown unconditional: 126] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 30, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 145, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 809, positive: 720, positive conditional: 720, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 720, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 126, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 720, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 126, unknown conditional: 0, unknown unconditional: 126] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 55, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 154, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 809, positive: 720, positive conditional: 720, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 720, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 126, positive: 126, positive conditional: 0, positive unconditional: 126, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 720, positive: 594, positive conditional: 0, positive unconditional: 594, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 126, unknown conditional: 0, unknown unconditional: 126] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 89, Statistics for Abstraction: - TimeoutResultAtElement [Line: 762]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PartialOrderCegarLoop was analyzing trace of length 721 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 11 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 473 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 830.1s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.9s, 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: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 46.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2686 NumberOfCodeBlocks, 2686 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3828 ConstructedInterpolants, 0 QuantifiedInterpolants, 7346 SizeOfPredicates, 22 NumberOfNonLiveVariables, 3144 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3849 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown