/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_17-arrayloop_nr.line762.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-5c708e3-m [2022-10-03 12:50:52,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-03 12:50:52,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-03 12:50:52,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-03 12:50:52,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-03 12:50:52,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-03 12:50:52,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-03 12:50:52,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-03 12:50:52,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-03 12:50:52,173 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-03 12:50:52,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-03 12:50:52,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-03 12:50:52,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-03 12:50:52,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-03 12:50:52,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-03 12:50:52,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-03 12:50:52,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-03 12:50:52,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-03 12:50:52,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-03 12:50:52,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-03 12:50:52,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-03 12:50:52,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-03 12:50:52,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-03 12:50:52,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-03 12:50:52,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-03 12:50:52,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-03 12:50:52,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-03 12:50:52,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-03 12:50:52,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-03 12:50:52,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-03 12:50:52,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-03 12:50:52,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-03 12:50:52,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-03 12:50:52,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-03 12:50:52,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-03 12:50:52,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-03 12:50:52,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-03 12:50:52,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-03 12:50:52,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-03 12:50:52,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-03 12:50:52,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-03 12:50:52,211 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:50:52,237 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-03 12:50:52,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-03 12:50:52,238 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-03 12:50:52,238 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-03 12:50:52,238 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-03 12:50:52,239 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-03 12:50:52,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-03 12:50:52,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-03 12:50:52,239 INFO L138 SettingsManager]: * Use SBE=true [2022-10-03 12:50:52,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-03 12:50:52,240 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-03 12:50:52,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-03 12:50:52,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-03 12:50:52,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-03 12:50:52,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-03 12:50:52,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-03 12:50:52,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-03 12:50:52,240 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-03 12:50:52,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-03 12:50:52,241 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-03 12:50:52,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-03 12:50:52,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-03 12:50:52,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-03 12:50:52,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-03 12:50:52,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-03 12:50:52,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 12:50:52,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-03 12:50:52,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-03 12:50:52,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-03 12:50:52,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-03 12:50:52,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-03 12:50:52,243 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-03 12:50:52,243 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-03 12:50:52,243 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-03 12:50:52,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-03 12:50:52,243 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-03 12:50:52,243 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-03 12:50:52,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-03 12:50:52,243 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:50:52,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-03 12:50:52,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-03 12:50:52,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-03 12:50:52,488 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-03 12:50:52,488 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-03 12:50:52,489 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_17-arrayloop_nr.line762.bpl [2022-10-03 12:50:52,490 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/09-regions_17-arrayloop_nr.line762.bpl' [2022-10-03 12:50:52,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-03 12:50:52,530 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2022-10-03 12:50:52,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-03 12:50:52,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-03 12:50:52,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-03 12:50:52,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:50:52" (1/1) ... [2022-10-03 12:50:52,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:50:52" (1/1) ... [2022-10-03 12:50:52,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:50:52" (1/1) ... [2022-10-03 12:50:52,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:50:52" (1/1) ... [2022-10-03 12:50:52,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:50:52" (1/1) ... [2022-10-03 12:50:52,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:50:52" (1/1) ... [2022-10-03 12:50:52,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:50:52" (1/1) ... [2022-10-03 12:50:52,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-03 12:50:52,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-03 12:50:52,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-03 12:50:52,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-03 12:50:52,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:50:52" (1/1) ... [2022-10-03 12:50:52,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-03 12:50:52,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:50:52,633 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:50:52,661 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:50:52,676 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-10-03 12:50:52,676 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-10-03 12:50:52,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-03 12:50:52,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-03 12:50:52,677 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:50:52,822 INFO L234 CfgBuilder]: Building ICFG [2022-10-03 12:50:52,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-03 12:50:53,190 INFO L275 CfgBuilder]: Performing block encoding [2022-10-03 12:50:53,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-03 12:50:53,203 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-03 12:50:53,205 INFO L202 PluginConnector]: Adding new model 09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:50:53 BoogieIcfgContainer [2022-10-03 12:50:53,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-03 12:50:53,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-03 12:50:53,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-03 12:50:53,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-03 12:50:53,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.10 12:50:52" (1/2) ... [2022-10-03 12:50:53,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@707fbd2b and model type 09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 12:50:53, skipping insertion in model container [2022-10-03 12:50:53,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "09-regions_17-arrayloop_nr.line762.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:50:53" (2/2) ... [2022-10-03 12:50:53,212 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.line762.bpl [2022-10-03 12:50:53,218 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-03 12:50:53,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-03 12:50:53,224 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-03 12:50:53,225 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-03 12:50:53,278 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-03 12:50:53,312 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-03 12:50:53,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-03 12:50:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:50:53,317 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:50:53,319 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:50:53,348 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-03 12:50:53,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONASSERT ======== [2022-10-03 12:50:53,362 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;@38826819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-03 12:50:53,362 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-03 12:50:53,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:50:53,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:50:53,633 INFO L85 PathProgramCache]: Analyzing trace with hash -70554807, now seen corresponding path program 1 times [2022-10-03 12:50:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:50:53,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547897883] [2022-10-03 12:50:53,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:50:53,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:50:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:50:53,915 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:50:53,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:50:53,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547897883] [2022-10-03 12:50:53,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547897883] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 12:50:53,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 12:50:53,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-03 12:50:53,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650500230] [2022-10-03 12:50:53,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 12:50:53,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-03 12:50:53,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:50:53,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-03 12:50:53,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-03 12:50:53,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:53,964 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:50:53,964 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:50:53,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:53,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-03 12:50:53,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:50:53,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:50:53,991 INFO L85 PathProgramCache]: Analyzing trace with hash -342991094, now seen corresponding path program 1 times [2022-10-03 12:50:53,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:50:53,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086934763] [2022-10-03 12:50:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:50:53,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:50:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:50:54,113 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:50:54,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:50:54,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086934763] [2022-10-03 12:50:54,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086934763] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-03 12:50:54,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-03 12:50:54,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-03 12:50:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571283559] [2022-10-03 12:50:54,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-03 12:50:54,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-03 12:50:54,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:50:54,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-03 12:50:54,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-03 12:50:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:54,116 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:50:54,116 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:50:54,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:54,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:54,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:54,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:50:54,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-03 12:50:54,198 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:50:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:50:54,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1183963772, now seen corresponding path program 1 times [2022-10-03 12:50:54,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:50:54,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512447334] [2022-10-03 12:50:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:50:54,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:50:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:50:54,388 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:50:54,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:50:54,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512447334] [2022-10-03 12:50:54,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512447334] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:50:54,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792040555] [2022-10-03 12:50:54,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:50:54,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:50:54,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:50:54,404 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:50:54,406 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:50:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:50:54,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-03 12:50:54,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:50:54,703 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:50:54,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:50:54,808 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:50:54,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792040555] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 12:50:54,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 12:50:54,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-03 12:50:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468569420] [2022-10-03 12:50:54,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 12:50:54,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-03 12:50:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:50:54,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-03 12:50:54,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-03 12:50:54,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:54,814 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:50:54,815 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:50:54,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:54,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:50:54,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:50:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:50:54,924 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:50:55,110 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:50:55,110 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:50:55,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:50:55,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1665130692, now seen corresponding path program 2 times [2022-10-03 12:50:55,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:50:55,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094416125] [2022-10-03 12:50:55,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:50:55,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:50:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:50:55,311 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:50:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:50:55,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094416125] [2022-10-03 12:50:55,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094416125] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:50:55,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588394236] [2022-10-03 12:50:55,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-03 12:50:55,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:50:55,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:50:55,314 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:50:55,315 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:50:55,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-03 12:50:55,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 12:50:55,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-03 12:50:55,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:50:55,714 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:50:55,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:50:55,909 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:50:55,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588394236] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 12:50:55,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 12:50:55,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-10-03 12:50:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379980464] [2022-10-03 12:50:55,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 12:50:55,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-03 12:50:55,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:50:55,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-03 12:50:55,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-10-03 12:50:55,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:55,912 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:50:55,913 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:50:55,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:55,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:50:55,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:50:55,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:50:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:50:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:50:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 12:50:56,090 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:50:56,287 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:50:56,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:50:56,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:50:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash 896587964, now seen corresponding path program 3 times [2022-10-03 12:50:56,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:50:56,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198741648] [2022-10-03 12:50:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:50:56,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:50:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:50:56,722 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:50:56,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:50:56,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198741648] [2022-10-03 12:50:56,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198741648] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:50:56,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900793963] [2022-10-03 12:50:56,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-03 12:50:56,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:50:56,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:50:56,724 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:50:56,726 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:52:14,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-10-03 12:52:14,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 12:52:14,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 1548 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-03 12:52:14,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:52:14,524 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:52:14,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:52:14,912 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:52:14,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900793963] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-03 12:52:14,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-03 12:52:14,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-10-03 12:52:14,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538699459] [2022-10-03 12:52:14,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-03 12:52:14,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-03 12:52:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-03 12:52:14,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-03 12:52:14,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-10-03 12:52:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:52:14,917 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-03 12:52:14,917 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:52:14,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:52:14,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:52:14,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:52:14,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-03 12:52:14,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:52:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-03 12:52:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-03 12:52:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-03 12:52:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-03 12:52:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-03 12:52:15,281 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:52:15,443 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:52:15,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT] === [2022-10-03 12:52:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-03 12:52:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash 231477066, now seen corresponding path program 4 times [2022-10-03 12:52:15,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-03 12:52:15,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842281192] [2022-10-03 12:52:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-03 12:52:15,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-03 12:52:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-03 12:52:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 512 proven. 1883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:52:37,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-03 12:52:37,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842281192] [2022-10-03 12:52:37,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842281192] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-03 12:52:37,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864823] [2022-10-03 12:52:37,451 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-03 12:52:37,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-03 12:52:37,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-03 12:52:37,452 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:52:37,453 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:52:37,959 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-03 12:52:37,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-03 12:52:37,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 394 conjunts are in the unsatisfiable core [2022-10-03 12:52:37,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-03 12:52:38,327 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:52:39,257 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:52:39,444 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-03 12:52:39,444 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:52:41,077 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:52:42,202 INFO L356 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-10-03 12:52:42,203 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:52:42,485 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-03 12:52:42,486 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:52:43,681 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:52:44,126 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:52:45,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:52:45,153 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 42 treesize of output 33 [2022-10-03 12:52:46,449 INFO L356 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-10-03 12:52:46,449 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:52:46,724 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-03 12:52:46,725 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 1 case distinctions, treesize of input 23 treesize of output 28 [2022-10-03 12:52:47,721 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 45 treesize of output 41 [2022-10-03 12:52:48,304 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 45 treesize of output 41 [2022-10-03 12:52:49,049 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-10-03 12:52:49,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 22 [2022-10-03 12:52:49,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:52:49,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-10-03 12:52:50,289 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-10-03 12:52:50,290 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 26 treesize of output 41 [2022-10-03 12:52:51,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-10-03 12:52:51,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-10-03 12:52:53,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:52:53,232 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 37 treesize of output 28 [2022-10-03 12:52:54,942 INFO L356 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2022-10-03 12:52:54,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2022-10-03 12:52:56,782 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 40 treesize of output 36 [2022-10-03 12:52:57,617 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 40 treesize of output 36 [2022-10-03 12:52:58,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:52:58,920 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 37 treesize of output 28 [2022-10-03 12:53:00,550 INFO L356 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2022-10-03 12:53:00,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2022-10-03 12:53:02,416 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 40 treesize of output 36 [2022-10-03 12:53:03,176 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 40 treesize of output 36 [2022-10-03 12:53:04,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:53:04,481 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 37 treesize of output 28 [2022-10-03 12:53:06,131 INFO L356 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2022-10-03 12:53:06,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2022-10-03 12:53:08,075 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 40 treesize of output 36 [2022-10-03 12:53:09,038 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 40 treesize of output 36 [2022-10-03 12:53:10,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:53:10,631 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:53:12,755 INFO L356 Elim1Store]: treesize reduction 84, result has 34.9 percent of original size [2022-10-03 12:53:12,755 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:53:15,010 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:53:15,965 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:53:17,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:53:17,315 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:53:19,447 INFO L356 Elim1Store]: treesize reduction 84, result has 34.9 percent of original size [2022-10-03 12:53:19,448 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:53:21,891 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:53:22,877 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:53:24,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:53:24,570 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:53:26,911 INFO L356 Elim1Store]: treesize reduction 102, result has 34.6 percent of original size [2022-10-03 12:53:26,914 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:53:29,568 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:53:30,783 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:53:35,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-03 12:53:35,217 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:53:41,893 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:53:49,623 INFO L356 Elim1Store]: treesize reduction 120, result has 34.4 percent of original size [2022-10-03 12:53:49,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 46 treesize of output 89 [2022-10-03 12:53:53,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2022-10-03 12:53:54,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2022-10-03 12:54:02,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-03 12:54:02,426 INFO L356 Elim1Store]: treesize reduction 57, result has 16.2 percent of original size [2022-10-03 12:54:02,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 67 [2022-10-03 12:54:02,433 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:54:04,721 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-03 12:54:04,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 321 treesize of output 238 [2022-10-03 12:54:04,737 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-03 12:54:04,737 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 211 [2022-10-03 12:54:06,556 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 139 treesize of output 107 [2022-10-03 12:54:08,286 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-03 12:54:08,286 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 150 treesize of output 61 [2022-10-03 12:54:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 1066 proven. 1329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-03 12:54:10,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-03 12:54:10,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1374 (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_write~$Pointer$_#ptr#1.base| v_ArrVal_1374))) (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_write~$Pointer$_#ptr#1.base| v_ArrVal_1375) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:54:10,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1374 (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_1374))) (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_1375) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:54:10,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1374 (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_1374))) (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_1375) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:54:10,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1371 (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_1374))) (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_1371) |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1375) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:54:11,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1371 (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_1374))) (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_1371) |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_1375) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:54:12,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1371 (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_1374))) (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_1371) |c_ULTIMATE.start_list_add_#in~node#1.base| v_ArrVal_1375) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:54:13,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1371 (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_1374))) (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_1371) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1375) |c_~#slot~0.base|) .cse1) 4)))) 1)) is different from false [2022-10-03 12:54:13,165 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-03 12:54:13,165 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 340 treesize of output 315 [2022-10-03 12:54:13,168 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 300 treesize of output 288 [2022-10-03 12:54:13,172 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 146 treesize of output 140 [2022-10-03 12:54:13,441 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_#t~ret42#1.base| |c_~#slot~0.base|)) (.cse5 (= |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 ((.cse18 (not .cse5)) (.cse1 (not .cse6))) (let ((.cse0 (or .cse1 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int 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) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse53 (select (select .cse53 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_93))) 1)))) (.cse25 (let ((.cse40 (or .cse1 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse51 (store (let ((.cse52 (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| .cse52 (store (select |c_#memory_$Pointer$.base| .cse52) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse51 (select (select .cse51 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_93))) 1))))) (and (or .cse1 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse30 (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) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse31 (select (select .cse31 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse30 (+ 4 v_arrayElimCell_93))) 1) (= (select |c_#valid| (select .cse30 (+ 4 v_arrayElimCell_94))) 1))))) (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse33 (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) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse34 (select (select .cse34 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse33 (+ 4 v_arrayElimCell_93))) 1) (= (select |c_#valid| (select .cse33 (+ 4 v_arrayElimCell_94))) 1) (= (select |c_#valid| (select .cse33 (+ 4 v_arrayElimCell_92))) 1)))) (or .cse18 (and (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (or (= (select |c_#valid| (select (let ((.cse36 (store (let ((.cse37 (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| .cse37 (store (select |c_#memory_$Pointer$.base| .cse37) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse36 (select (select .cse36 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_93))) 1) (forall ((v_arrayElimCell_94 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) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse38 (select (select .cse38 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_94))) 1)))) .cse40 (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse41 (store (let ((.cse42 (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| .cse42 (store (select |c_#memory_$Pointer$.base| .cse42) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse41 (select (select .cse41 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_94))) 1)) .cse6))) .cse40 (or .cse5 (and (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse43 (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) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse44 (select (select .cse44 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse43 (+ 4 v_arrayElimCell_93))) 1) (= (select |c_#valid| (select .cse43 (+ 4 v_arrayElimCell_92))) 1)))) .cse40 (or (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse46 (store (let ((.cse47 (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| .cse47 (store (select |c_#memory_$Pointer$.base| .cse47) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse46 (select (select .cse46 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_92))) 1)) .cse6))) (or .cse6 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse48 (let ((.cse49 (store (let ((.cse50 (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| .cse50 (store (select |c_#memory_$Pointer$.base| .cse50) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse49 (select (select .cse49 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse48 (+ 4 v_arrayElimCell_94))) 1) (= (select |c_#valid| (select .cse48 (+ 4 v_arrayElimCell_92))) 1))))))))) (and .cse0 (or .cse1 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store (let ((.cse4 (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| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse3 (select (select .cse3 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse2 (+ 4 v_arrayElimCell_94))) 1) (= (select |c_#valid| (select .cse2 (+ 4 v_arrayElimCell_93))) 1))))) (or .cse5 (and .cse0 (or .cse6 (forall ((v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (let ((.cse9 (+ 4 v_arrayElimCell_92))) (select (let ((.cse7 (store (let ((.cse8 (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| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) .cse9 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse7 (select (select .cse7 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) .cse9))) 1))) (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse11 (+ 4 v_arrayElimCell_92))) (let ((.cse10 (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) .cse11 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse12 (select (select .cse12 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse10 .cse11)) 1) (= (select |c_#valid| (select .cse10 (+ 4 v_arrayElimCell_93))) 1))))))) (or .cse6 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse15 (+ 4 v_arrayElimCell_92))) (let ((.cse14 (let ((.cse16 (store (let ((.cse17 (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| .cse17 (store (select |c_#memory_$Pointer$.base| .cse17) .cse15 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse16 (select (select .cse16 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse14 (+ 4 v_arrayElimCell_94))) 1) (= (select |c_#valid| (select .cse14 .cse15)) 1)))))) (or .cse18 (and .cse0 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (or (= (select |c_#valid| (select (let ((.cse19 (store (let ((.cse20 (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| .cse20 (store (select |c_#memory_$Pointer$.base| .cse20) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse19 (select (select .cse19 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_93))) 1) (forall ((v_arrayElimCell_94 Int)) (= (select |c_#valid| (select (let ((.cse21 (store (let ((.cse22 (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| .cse22 (store (select |c_#memory_$Pointer$.base| .cse22) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse21 (select (select .cse21 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_94))) 1)))) (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse23 (store (let ((.cse24 (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| .cse24 (store (select |c_#memory_$Pointer$.base| .cse24) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse23 (select (select .cse23 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_94))) 1)) .cse6))) (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) .cse25) (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_~#slot~0.base|) .cse25) (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse27 (+ 4 v_arrayElimCell_92))) (let ((.cse26 (let ((.cse28 (store (let ((.cse29 (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| .cse29 (store (select |c_#memory_$Pointer$.base| .cse29) .cse27 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse28 (select (select .cse28 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse26 (+ 4 v_arrayElimCell_94))) 1) (= (select |c_#valid| (select .cse26 .cse27)) 1) (= (select |c_#valid| (select .cse26 (+ 4 v_arrayElimCell_93))) 1))))))))) is different from false [2022-10-03 12:54:15,465 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_main_#t~ret42#1.base| |c_~#slot~0.base|)) (.cse5 (= |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 ((.cse18 (not .cse5)) (.cse1 (not .cse6))) (let ((.cse0 (or .cse1 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int 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) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse53 (select (select .cse53 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_93))) 1)))) (.cse25 (let ((.cse40 (or .cse1 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse51 (store (let ((.cse52 (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| .cse52 (store (select |c_#memory_$Pointer$.base| .cse52) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse51 (select (select .cse51 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_93))) 1))))) (and (or .cse1 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse30 (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) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse31 (select (select .cse31 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse30 (+ 4 v_arrayElimCell_93))) 1) (= (select |c_#valid| (select .cse30 (+ 4 v_arrayElimCell_94))) 1))))) (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse33 (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) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse34 (select (select .cse34 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse33 (+ 4 v_arrayElimCell_93))) 1) (= (select |c_#valid| (select .cse33 (+ 4 v_arrayElimCell_94))) 1) (= (select |c_#valid| (select .cse33 (+ 4 v_arrayElimCell_92))) 1)))) (or .cse18 (and (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (or (= (select |c_#valid| (select (let ((.cse36 (store (let ((.cse37 (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| .cse37 (store (select |c_#memory_$Pointer$.base| .cse37) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse36 (select (select .cse36 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_93))) 1) (forall ((v_arrayElimCell_94 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) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse38 (select (select .cse38 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_94))) 1)))) .cse40 (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse41 (store (let ((.cse42 (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| .cse42 (store (select |c_#memory_$Pointer$.base| .cse42) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse41 (select (select .cse41 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_94))) 1)) .cse6))) .cse40 (or .cse5 (and (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse43 (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) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse44 (select (select .cse44 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse43 (+ 4 v_arrayElimCell_93))) 1) (= (select |c_#valid| (select .cse43 (+ 4 v_arrayElimCell_92))) 1)))) .cse40 (or (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse46 (store (let ((.cse47 (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| .cse47 (store (select |c_#memory_$Pointer$.base| .cse47) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse46 (select (select .cse46 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_92))) 1)) .cse6))) (or .cse6 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse48 (let ((.cse49 (store (let ((.cse50 (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| .cse50 (store (select |c_#memory_$Pointer$.base| .cse50) (+ 4 v_arrayElimCell_91) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse49 (select (select .cse49 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse48 (+ 4 v_arrayElimCell_94))) 1) (= (select |c_#valid| (select .cse48 (+ 4 v_arrayElimCell_92))) 1))))))))) (and .cse0 (or .cse1 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store (let ((.cse4 (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| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse3 (select (select .cse3 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse2 (+ 4 v_arrayElimCell_94))) 1) (= (select |c_#valid| (select .cse2 (+ 4 v_arrayElimCell_93))) 1))))) (or .cse5 (and .cse0 (or .cse6 (forall ((v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (let ((.cse9 (+ 4 v_arrayElimCell_92))) (select (let ((.cse7 (store (let ((.cse8 (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| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) .cse9 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse7 (select (select .cse7 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) .cse9))) 1))) (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse11 (+ 4 v_arrayElimCell_92))) (let ((.cse10 (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) .cse11 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse12 (select (select .cse12 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse10 .cse11)) 1) (= (select |c_#valid| (select .cse10 (+ 4 v_arrayElimCell_93))) 1))))))) (or .cse6 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse15 (+ 4 v_arrayElimCell_92))) (let ((.cse14 (let ((.cse16 (store (let ((.cse17 (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| .cse17 (store (select |c_#memory_$Pointer$.base| .cse17) .cse15 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse16 (select (select .cse16 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse14 (+ 4 v_arrayElimCell_94))) 1) (= (select |c_#valid| (select .cse14 .cse15)) 1)))))) (or .cse18 (and .cse0 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (or (= (select |c_#valid| (select (let ((.cse19 (store (let ((.cse20 (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| .cse20 (store (select |c_#memory_$Pointer$.base| .cse20) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse19 (select (select .cse19 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_93))) 1) (forall ((v_arrayElimCell_94 Int)) (= (select |c_#valid| (select (let ((.cse21 (store (let ((.cse22 (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| .cse22 (store (select |c_#memory_$Pointer$.base| .cse22) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse21 (select (select .cse21 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_94))) 1)))) (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse23 (store (let ((.cse24 (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| .cse24 (store (select |c_#memory_$Pointer$.base| .cse24) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse23 (select (select .cse23 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))) (+ 4 v_arrayElimCell_94))) 1)) .cse6))) (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.offset| (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) .cse25) (or (= |c_ULTIMATE.start_read~$Pointer$_#ptr#1.base| |c_~#slot~0.base|) .cse25) (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse27 (+ 4 v_arrayElimCell_92))) (let ((.cse26 (let ((.cse28 (store (let ((.cse29 (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| .cse29 (store (select |c_#memory_$Pointer$.base| .cse29) .cse27 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse28 (select (select .cse28 |c_~#slot~0.base|) (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))))))) (or (= (select |c_#valid| (select .cse26 (+ 4 v_arrayElimCell_94))) 1) (= (select |c_#valid| (select .cse26 .cse27)) 1) (= (select |c_#valid| (select .cse26 (+ 4 v_arrayElimCell_93))) 1))))))))) is different from true [2022-10-03 12:54:16,324 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c_ULTIMATE.start_main_#t~ret42#1.base| |c_~#slot~0.base|))) (let ((.cse17 (not .cse11))) (let ((.cse6 (= |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))))) (.cse5 (or .cse17 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse37 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse36 (store (let ((.cse38 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse37))) (store |c_#memory_$Pointer$.base| .cse38 (store (select |c_#memory_$Pointer$.base| .cse38) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse36 (select (select .cse36 |c_~#slot~0.base|) .cse37)))) (+ 4 v_arrayElimCell_93))) 1))))) (and (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse1 (+ 4 v_arrayElimCell_92))) (let ((.cse0 (let ((.cse3 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse2 (store (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse3))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse1 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse2 (select (select .cse2 |c_~#slot~0.base|) .cse3)))))) (or (= (select |c_#valid| (select .cse0 .cse1)) 1) (= (select |c_#valid| (select .cse0 (+ 4 v_arrayElimCell_93))) 1) (= (select |c_#valid| (select .cse0 (+ 4 v_arrayElimCell_94))) 1))))) .cse5 (or .cse6 (and (or (forall ((v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (let ((.cse10 (+ 4 v_arrayElimCell_92))) (select (let ((.cse8 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse7 (store (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse8))) (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) .cse10 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse7 (select (select .cse7 |c_~#slot~0.base|) .cse8)))) .cse10))) 1)) .cse11) (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse13 (+ 4 v_arrayElimCell_92))) (let ((.cse12 (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) .cse13 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse14 (select (select .cse14 |c_~#slot~0.base|) .cse15)))))) (or (= (select |c_#valid| (select .cse12 .cse13)) 1) (= (select |c_#valid| (select .cse12 (+ 4 v_arrayElimCell_93))) 1))))) .cse5)) (or .cse17 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse18 (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) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse19 (select (select .cse19 |c_~#slot~0.base|) .cse20)))))) (or (= (select |c_#valid| (select .cse18 (+ 4 v_arrayElimCell_93))) 1) (= (select |c_#valid| (select .cse18 (+ 4 v_arrayElimCell_94))) 1))))) (or .cse11 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (let ((.cse23 (+ 4 v_arrayElimCell_92))) (let ((.cse22 (let ((.cse25 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse24 (store (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse25))) (store |c_#memory_$Pointer$.base| .cse26 (store (select |c_#memory_$Pointer$.base| .cse26) .cse23 |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse24 (select (select .cse24 |c_~#slot~0.base|) .cse25)))))) (or (= (select |c_#valid| (select .cse22 .cse23)) 1) (= (select |c_#valid| (select .cse22 (+ 4 v_arrayElimCell_94))) 1)))))) (or (not .cse6) (and (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (or (forall ((v_arrayElimCell_94 Int)) (= (select |c_#valid| (select (let ((.cse28 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse27 (store (let ((.cse29 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse28))) (store |c_#memory_$Pointer$.base| .cse29 (store (select |c_#memory_$Pointer$.base| .cse29) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse27 (select (select .cse27 |c_~#slot~0.base|) .cse28)))) (+ 4 v_arrayElimCell_94))) 1)) (= (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) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse30 (select (select .cse30 |c_~#slot~0.base|) .cse31)))) (+ 4 v_arrayElimCell_93))) 1))) .cse5 (or .cse11 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse34 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse33 (store (let ((.cse35 (select (select |c_#memory_$Pointer$.base| |c_~#slot~0.base|) .cse34))) (store |c_#memory_$Pointer$.base| .cse35 (store (select |c_#memory_$Pointer$.base| .cse35) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_main_#t~ret42#1.base|))) |c_ULTIMATE.start_main_#t~ret42#1.base| v_ArrVal_1374))) (select .cse33 (select (select .cse33 |c_~#slot~0.base|) .cse34)))) (+ 4 v_arrayElimCell_94))) 1))))))))) is different from false [2022-10-03 12:54:28,936 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#slot~0.base| |c_ULTIMATE.start_new_~p~0#1.base|))) (let ((.cse14 (not .cse0))) (and (or .cse0 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse3 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1370)) (.cse2 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse4 (select (select .cse3 |c_~#slot~0.base|) .cse2))) (or (= (select |c_#valid| (select (let ((.cse1 (store (store .cse3 .cse4 (store (select .cse3 .cse4) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse1 (select (select .cse1 |c_~#slot~0.base|) .cse2))) (+ 4 v_arrayElimCell_94))) 1) (not (= |c_~#slot~0.base| .cse4))))))) (forall ((v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (let ((.cse9 (+ 4 v_arrayElimCell_92))) (select (let ((.cse6 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse5 (store (let ((.cse7 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1370))) (let ((.cse8 (select (select .cse7 |c_~#slot~0.base|) .cse6))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse5 (select (select .cse5 |c_~#slot~0.base|) .cse6)))) .cse9))) 1)) (or (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse11 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse10 (store (let ((.cse12 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1370))) (let ((.cse13 (select (select .cse12 |c_~#slot~0.base|) .cse11))) (store .cse12 .cse13 (store (select .cse12 .cse13) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse10 (select (select .cse10 |c_~#slot~0.base|) .cse11)))) (+ 4 v_arrayElimCell_93))) 1)) .cse14) (or .cse14 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse17 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~$Pointer$_#ptr#1.base| v_ArrVal_1370)) (.cse16 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse18 (select (select .cse17 |c_~#slot~0.base|) .cse16))) (or (= (select |c_#valid| (select (let ((.cse15 (store (store .cse17 .cse18 (store (select .cse17 .cse18) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse15 (select (select .cse15 |c_~#slot~0.base|) .cse16))) (+ 4 v_arrayElimCell_93))) 1) (not (= |c_~#slot~0.base| .cse18)))))))))) is different from false [2022-10-03 12:54:29,040 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_~#slot~0.base| |c_ULTIMATE.start_new_~p~0#1.base|))) (let ((.cse4 (not .cse10))) (and (or (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse1 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse0 (store (let ((.cse2 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1370))) (let ((.cse3 (select (select .cse2 |c_~#slot~0.base|) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse0 (select (select .cse0 |c_~#slot~0.base|) .cse1)))) (+ 4 v_arrayElimCell_93))) 1)) .cse4) (forall ((v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (let ((.cse9 (+ 4 v_arrayElimCell_92))) (select (let ((.cse6 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse5 (store (let ((.cse7 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1370))) (let ((.cse8 (select (select .cse7 |c_~#slot~0.base|) .cse6))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse5 (select (select .cse5 |c_~#slot~0.base|) .cse6)))) .cse9))) 1)) (or .cse10 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse13 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1370)) (.cse12 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse14 (select (select .cse13 |c_~#slot~0.base|) .cse12))) (or (= (select |c_#valid| (select (let ((.cse11 (store (store .cse13 .cse14 (store (select .cse13 .cse14) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse11 (select (select .cse11 |c_~#slot~0.base|) .cse12))) (+ 4 v_arrayElimCell_94))) 1) (not (= .cse14 |c_~#slot~0.base|))))))) (or .cse4 (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse17 (store |c_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1370)) (.cse16 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse18 (select (select .cse17 |c_~#slot~0.base|) .cse16))) (or (= (select |c_#valid| (select (let ((.cse15 (store (store .cse17 .cse18 (store (select .cse17 .cse18) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse15 (select (select .cse15 |c_~#slot~0.base|) .cse16))) (+ 4 v_arrayElimCell_93))) 1) (not (= .cse18 |c_~#slot~0.base|)))))))))) is different from false [2022-10-03 12:54:31,063 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1369 (Array Int Int)) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse1 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse0 (store (let ((.cse2 (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1369) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1370))) (let ((.cse3 (select (select .cse2 |c_~#slot~0.base|) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse0 (select (select .cse0 |c_~#slot~0.base|) .cse1)))) (+ 4 v_arrayElimCell_93))) 1)) (not (= |c_~#slot~0.base| |c_ULTIMATE.start_new_~p~0#1.base|))) (forall ((v_arrayElimCell_94 Int) (v_ArrVal_1369 (Array Int Int)) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse6 (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1369) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1370)) (.cse5 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse7 (select (select .cse6 |c_~#slot~0.base|) .cse5))) (or (= (select |c_#valid| (select (let ((.cse4 (store (store .cse6 .cse7 (store (select .cse6 .cse7) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse4 (select (select .cse4 |c_~#slot~0.base|) .cse5))) (+ 4 v_arrayElimCell_94))) 1) (not (= |c_~#slot~0.base| .cse7)))))) (forall ((v_ArrVal_1369 (Array Int Int)) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (let ((.cse12 (+ 4 v_arrayElimCell_92))) (select (let ((.cse9 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse8 (store (let ((.cse10 (store (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_write~int_#ptr#1.base| v_ArrVal_1369) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1370))) (let ((.cse11 (select (select .cse10 |c_~#slot~0.base|) .cse9))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse8 (select (select .cse8 |c_~#slot~0.base|) .cse9)))) .cse12))) 1))) is different from false [2022-10-03 12:54:31,126 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#slot~0.base| |c_ULTIMATE.start_new_~p~0#1.base|)) (forall ((v_arrayElimCell_93 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse1 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse0 (store (let ((.cse2 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1370))) (let ((.cse3 (select (select .cse2 |c_~#slot~0.base|) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse0 (select (select .cse0 |c_~#slot~0.base|) .cse1)))) (+ 4 v_arrayElimCell_93))) 1))) (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (let ((.cse6 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1370)) (.cse5 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse7 (select (select .cse6 |c_~#slot~0.base|) .cse5))) (or (= (select |c_#valid| (select (let ((.cse4 (store (store .cse6 .cse7 (store (select .cse6 .cse7) (+ 4 v_arrayElimCell_92) |c_ULTIMATE.start_new_~p~0#1.base|)) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse4 (select (select .cse4 |c_~#slot~0.base|) .cse5))) (+ 4 v_arrayElimCell_94))) 1) (not (= |c_~#slot~0.base| .cse7)))))) (forall ((v_arrayElimCell_92 Int) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select |c_#valid| (let ((.cse12 (+ 4 v_arrayElimCell_92))) (select (let ((.cse9 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse8 (store (let ((.cse10 (store |c_ULTIMATE.start_write~int_old_#memory_$Pointer$#1.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1370))) (let ((.cse11 (select (select .cse10 |c_~#slot~0.base|) .cse9))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 |c_ULTIMATE.start_new_~p~0#1.base|)))) |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_1374))) (select .cse8 (select (select .cse8 |c_~#slot~0.base|) .cse9)))) .cse12))) 1))) is different from false [2022-10-03 13:00:28,545 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-10-03 13:00:28,547 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-10-03 13:00:28,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-10-03 13:00:28,569 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 13:00:28,748 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 13:00:28,749 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:894) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 46 more [2022-10-03 13:00:28,752 INFO L158 Benchmark]: Toolchain (without parser) took 576221.95ms. Allocated memory was 242.2MB in the beginning and 706.7MB in the end (delta: 464.5MB). Free memory was 194.5MB in the beginning and 534.6MB in the end (delta: -340.1MB). Peak memory consumption was 522.8MB. Max. memory is 8.0GB. [2022-10-03 13:00:28,752 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 242.2MB. Free memory is still 197.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-03 13:00:28,752 INFO L158 Benchmark]: Boogie Preprocessor took 49.06ms. Allocated memory is still 242.2MB. Free memory was 194.4MB in the beginning and 191.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-03 13:00:28,752 INFO L158 Benchmark]: RCFGBuilder took 624.43ms. Allocated memory is still 242.2MB. Free memory was 191.0MB in the beginning and 189.4MB in the end (delta: 1.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-03 13:00:28,753 INFO L158 Benchmark]: TraceAbstraction took 575545.07ms. Allocated memory was 242.2MB in the beginning and 706.7MB in the end (delta: 464.5MB). Free memory was 188.9MB in the beginning and 534.6MB in the end (delta: -345.8MB). Peak memory consumption was 515.5MB. Max. memory is 8.0GB. [2022-10-03 13:00:28,753 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.13ms. Allocated memory is still 242.2MB. Free memory is still 197.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 49.06ms. Allocated memory is still 242.2MB. Free memory was 194.4MB in the beginning and 191.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 624.43ms. Allocated memory is still 242.2MB. Free memory was 191.0MB in the beginning and 189.4MB in the end (delta: 1.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 575545.07ms. Allocated memory was 242.2MB in the beginning and 706.7MB in the end (delta: 464.5MB). Free memory was 188.9MB in the beginning and 534.6MB in the end (delta: -345.8MB). Peak memory consumption was 515.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-10-03 13:00:28,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request...