/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-properties/splice-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:49:09,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:49:09,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:49:09,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:49:09,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:49:10,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:49:10,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:49:10,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:49:10,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:49:10,029 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:49:10,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:49:10,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:49:10,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:49:10,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:49:10,031 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:49:10,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:49:10,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:49:10,032 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:49:10,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:49:10,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:49:10,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:49:10,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:49:10,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:49:10,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:49:10,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:49:10,033 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:49:10,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:49:10,033 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:49:10,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:49:10,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:49:10,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:49:10,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:49:10,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:49:10,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:49:10,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:49:10,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:49:10,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:49:10,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:49:10,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:49:10,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:49:10,036 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:49:10,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:49:10,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:49:10,036 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:49:10,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:49:10,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:49:10,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:49:10,320 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:49:10,321 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:49:10,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-2.i [2023-12-15 21:49:11,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:49:11,774 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:49:11,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i [2023-12-15 21:49:11,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84834e757/6203a91fdddc4d8392c0f6aaa4a73b2e/FLAG76af2ce75 [2023-12-15 21:49:12,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84834e757/6203a91fdddc4d8392c0f6aaa4a73b2e [2023-12-15 21:49:12,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:49:12,072 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:49:12,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:49:12,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:49:12,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:49:12,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c1a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12, skipping insertion in model container [2023-12-15 21:49:12,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,112 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:49:12,351 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i[23721,23734] [2023-12-15 21:49:12,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:49:12,366 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:49:12,400 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i[23721,23734] [2023-12-15 21:49:12,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:49:12,423 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:49:12,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12 WrapperNode [2023-12-15 21:49:12,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:49:12,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:49:12,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:49:12,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:49:12,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,458 INFO L138 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2023-12-15 21:49:12,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:49:12,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:49:12,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:49:12,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:49:12,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,484 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2023-12-15 21:49:12,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:49:12,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:49:12,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:49:12,496 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:49:12,496 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (1/1) ... [2023-12-15 21:49:12,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:49:12,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:12,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:49:12,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:49:12,586 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-15 21:49:12,587 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-15 21:49:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:49:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:49:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:49:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:49:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:49:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:49:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:49:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:49:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:49:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:49:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:49:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:49:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:49:12,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:49:12,696 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:49:12,697 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:49:12,726 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-15 21:49:12,867 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:49:12,884 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:49:12,884 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-15 21:49:12,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:49:12 BoogieIcfgContainer [2023-12-15 21:49:12,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:49:12,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:49:12,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:49:12,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:49:12,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:49:12" (1/3) ... [2023-12-15 21:49:12,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24823b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:49:12, skipping insertion in model container [2023-12-15 21:49:12,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:49:12" (2/3) ... [2023-12-15 21:49:12,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24823b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:49:12, skipping insertion in model container [2023-12-15 21:49:12,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:49:12" (3/3) ... [2023-12-15 21:49:12,893 INFO L112 eAbstractionObserver]: Analyzing ICFG splice-2.i [2023-12-15 21:49:12,906 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:49:12,906 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:49:12,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:49:12,942 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@13c5e9ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:49:12,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:49:12,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.64) internal successors, (41), 27 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:49:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-15 21:49:12,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:12,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:12,953 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:12,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash 285317644, now seen corresponding path program 1 times [2023-12-15 21:49:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989468369] [2023-12-15 21:49:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:12,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:13,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:13,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989468369] [2023-12-15 21:49:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989468369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:49:13,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:49:13,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:49:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050267842] [2023-12-15 21:49:13,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:49:13,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:49:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:13,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:49:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:49:13,097 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.64) internal successors, (41), 27 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2023-12-15 21:49:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:13,116 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2023-12-15 21:49:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:49:13,117 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) Word has length 11 [2023-12-15 21:49:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:13,121 INFO L225 Difference]: With dead ends: 45 [2023-12-15 21:49:13,121 INFO L226 Difference]: Without dead ends: 22 [2023-12-15 21:49:13,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:49:13,126 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:13,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:49:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-15 21:49:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-15 21:49:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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) [2023-12-15 21:49:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-15 21:49:13,168 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 11 [2023-12-15 21:49:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:13,168 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-15 21:49:13,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2023-12-15 21:49:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-15 21:49:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-15 21:49:13,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:13,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:13,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:49:13,169 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:13,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash -726011293, now seen corresponding path program 1 times [2023-12-15 21:49:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872560966] [2023-12-15 21:49:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:13,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872560966] [2023-12-15 21:49:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872560966] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:49:13,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:49:13,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:49:13,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375554694] [2023-12-15 21:49:13,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:49:13,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:49:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:13,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:49:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:49:13,299 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2023-12-15 21:49:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:13,336 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2023-12-15 21:49:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:49:13,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13 [2023-12-15 21:49:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:13,337 INFO L225 Difference]: With dead ends: 44 [2023-12-15 21:49:13,337 INFO L226 Difference]: Without dead ends: 31 [2023-12-15 21:49:13,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:49:13,338 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:13,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:49:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-15 21:49:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2023-12-15 21:49:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:49:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-12-15 21:49:13,342 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2023-12-15 21:49:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:13,342 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-12-15 21:49:13,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2023-12-15 21:49:13,342 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-12-15 21:49:13,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-15 21:49:13,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:13,343 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:13,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:49:13,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:13,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:13,343 INFO L85 PathProgramCache]: Analyzing trace with hash -489421778, now seen corresponding path program 1 times [2023-12-15 21:49:13,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:13,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464705647] [2023-12-15 21:49:13,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:13,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 21:49:13,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464705647] [2023-12-15 21:49:13,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464705647] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:49:13,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:49:13,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:49:13,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677850517] [2023-12-15 21:49:13,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:49:13,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:49:13,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:13,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:49:13,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:49:13,428 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-12-15 21:49:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:13,469 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2023-12-15 21:49:13,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:49:13,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) Word has length 19 [2023-12-15 21:49:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:13,471 INFO L225 Difference]: With dead ends: 34 [2023-12-15 21:49:13,471 INFO L226 Difference]: Without dead ends: 26 [2023-12-15 21:49:13,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:49:13,472 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:13,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:49:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-15 21:49:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-15 21:49:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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) [2023-12-15 21:49:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-12-15 21:49:13,476 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 19 [2023-12-15 21:49:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:13,476 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-12-15 21:49:13,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-12-15 21:49:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-12-15 21:49:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 21:49:13,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:13,477 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:13,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:49:13,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:13,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash -612434823, now seen corresponding path program 1 times [2023-12-15 21:49:13,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:13,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755691192] [2023-12-15 21:49:13,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:13,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:13,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:13,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755691192] [2023-12-15 21:49:13,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755691192] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:13,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146355134] [2023-12-15 21:49:13,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:13,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:13,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:13,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:49:13,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:49:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:13,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 21:49:13,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 21:49:13,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 21:49:13,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146355134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:49:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 21:49:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-12-15 21:49:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372309952] [2023-12-15 21:49:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:49:13,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:49:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:13,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:49:13,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:49:13,693 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2023-12-15 21:49:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:13,712 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2023-12-15 21:49:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:49:13,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 22 [2023-12-15 21:49:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:13,715 INFO L225 Difference]: With dead ends: 66 [2023-12-15 21:49:13,715 INFO L226 Difference]: Without dead ends: 45 [2023-12-15 21:49:13,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:49:13,716 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:13,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 62 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:49:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-15 21:49:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2023-12-15 21:49:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 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) [2023-12-15 21:49:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2023-12-15 21:49:13,726 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 22 [2023-12-15 21:49:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:13,726 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2023-12-15 21:49:13,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2023-12-15 21:49:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2023-12-15 21:49:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 21:49:13,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:13,728 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:13,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 21:49:13,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:13,934 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:13,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1907525111, now seen corresponding path program 1 times [2023-12-15 21:49:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:13,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641668035] [2023-12-15 21:49:13,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:14,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:14,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641668035] [2023-12-15 21:49:14,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641668035] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:14,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356098045] [2023-12-15 21:49:14,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:14,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:14,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:14,449 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) [2023-12-15 21:49:14,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:49:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:14,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-15 21:49:14,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:14,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:49:14,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:49:14,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:49:14,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-15 21:49:14,737 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-12-15 21:49:14,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-15 21:49:14,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-15 21:49:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:14,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:49:14,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:14,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-12-15 21:49:14,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:14,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-12-15 21:49:14,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-15 21:49:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:15,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356098045] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:49:15,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:49:15,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2023-12-15 21:49:15,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254844701] [2023-12-15 21:49:15,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:49:15,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-15 21:49:15,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:15,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-15 21:49:15,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=580, Unknown=5, NotChecked=0, Total=702 [2023-12-15 21:49:15,091 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 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) [2023-12-15 21:49:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:15,516 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2023-12-15 21:49:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:49:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 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) Word has length 22 [2023-12-15 21:49:15,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:15,521 INFO L225 Difference]: With dead ends: 56 [2023-12-15 21:49:15,521 INFO L226 Difference]: Without dead ends: 54 [2023-12-15 21:49:15,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1049, Unknown=6, NotChecked=0, Total=1332 [2023-12-15 21:49:15,529 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 178 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:15,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 140 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:49:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-15 21:49:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2023-12-15 21:49:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 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) [2023-12-15 21:49:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2023-12-15 21:49:15,541 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 22 [2023-12-15 21:49:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:15,541 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2023-12-15 21:49:15,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 states have internal predecessors, (56), 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) [2023-12-15 21:49:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2023-12-15 21:49:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 21:49:15,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:15,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:15,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 21:49:15,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:15,748 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:15,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash -821079412, now seen corresponding path program 1 times [2023-12-15 21:49:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:15,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826582021] [2023-12-15 21:49:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:15,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 21:49:15,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:15,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826582021] [2023-12-15 21:49:15,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826582021] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:15,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646906308] [2023-12-15 21:49:15,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:15,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:15,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:15,824 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) [2023-12-15 21:49:15,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:49:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:15,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-15 21:49:15,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:15,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 21:49:15,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:49:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 21:49:15,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646906308] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:49:15,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:49:15,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-12-15 21:49:15,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028698453] [2023-12-15 21:49:15,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:49:15,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:49:15,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:15,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:49:15,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:49:15,997 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) [2023-12-15 21:49:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:16,068 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2023-12-15 21:49:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:49:16,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) Word has length 24 [2023-12-15 21:49:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:16,072 INFO L225 Difference]: With dead ends: 71 [2023-12-15 21:49:16,072 INFO L226 Difference]: Without dead ends: 66 [2023-12-15 21:49:16,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-15 21:49:16,074 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 111 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:16,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 59 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:49:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-15 21:49:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2023-12-15 21:49:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 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) [2023-12-15 21:49:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2023-12-15 21:49:16,086 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 24 [2023-12-15 21:49:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:16,086 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2023-12-15 21:49:16,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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) [2023-12-15 21:49:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2023-12-15 21:49:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 21:49:16,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:16,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:16,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-15 21:49:16,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:16,292 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:16,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:16,292 INFO L85 PathProgramCache]: Analyzing trace with hash -819369390, now seen corresponding path program 1 times [2023-12-15 21:49:16,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:16,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133576320] [2023-12-15 21:49:16,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:16,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:16,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:16,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133576320] [2023-12-15 21:49:16,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133576320] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:16,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363927345] [2023-12-15 21:49:16,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:16,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:16,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:16,566 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) [2023-12-15 21:49:16,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 21:49:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:16,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-15 21:49:16,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:16,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-15 21:49:16,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-15 21:49:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 21:49:16,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:49:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 21:49:16,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363927345] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:49:16,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:49:16,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2023-12-15 21:49:16,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076312732] [2023-12-15 21:49:16,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:49:16,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 21:49:16,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 21:49:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:49:16,744 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:49:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:16,866 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2023-12-15 21:49:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 21:49:16,867 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-15 21:49:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:16,867 INFO L225 Difference]: With dead ends: 63 [2023-12-15 21:49:16,867 INFO L226 Difference]: Without dead ends: 56 [2023-12-15 21:49:16,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-12-15 21:49:16,868 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:16,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 81 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:49:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-15 21:49:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2023-12-15 21:49:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 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) [2023-12-15 21:49:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2023-12-15 21:49:16,873 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 24 [2023-12-15 21:49:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:16,873 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-12-15 21:49:16,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:49:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2023-12-15 21:49:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-15 21:49:16,874 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:16,874 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:16,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:49:17,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:17,079 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:17,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1293927920, now seen corresponding path program 1 times [2023-12-15 21:49:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:17,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207650486] [2023-12-15 21:49:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207650486] [2023-12-15 21:49:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207650486] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672730763] [2023-12-15 21:49:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:17,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:17,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:17,617 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) [2023-12-15 21:49:17,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 21:49:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:17,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-15 21:49:17,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:17,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:49:17,782 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:49:17,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-15 21:49:17,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:49:17,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:49:17,862 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:49:17,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2023-12-15 21:49:17,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-12-15 21:49:17,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2023-12-15 21:49:17,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-12-15 21:49:17,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-15 21:49:17,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-15 21:49:17,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-15 21:49:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:17,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:49:18,034 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 3)) is different from false [2023-12-15 21:49:18,100 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_350) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 3)) is different from false [2023-12-15 21:49:18,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:18,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-12-15 21:49:18,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:18,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 78 [2023-12-15 21:49:18,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2023-12-15 21:49:18,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:18,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-12-15 21:49:18,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:18,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-12-15 21:49:18,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-15 21:49:18,225 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-15 21:49:18,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-15 21:49:18,229 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-15 21:49:18,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-12-15 21:49:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:18,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672730763] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:49:18,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:49:18,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2023-12-15 21:49:18,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344246547] [2023-12-15 21:49:18,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:49:18,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-15 21:49:18,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:18,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-15 21:49:18,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=8, NotChecked=118, Total=1056 [2023-12-15 21:49:18,331 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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) [2023-12-15 21:49:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:19,148 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2023-12-15 21:49:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:49:19,149 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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) Word has length 25 [2023-12-15 21:49:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:19,150 INFO L225 Difference]: With dead ends: 113 [2023-12-15 21:49:19,150 INFO L226 Difference]: Without dead ends: 94 [2023-12-15 21:49:19,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=291, Invalid=2258, Unknown=9, NotChecked=198, Total=2756 [2023-12-15 21:49:19,152 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 206 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:19,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 390 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 717 Invalid, 0 Unknown, 192 Unchecked, 0.3s Time] [2023-12-15 21:49:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-15 21:49:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 60. [2023-12-15 21:49:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:49:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2023-12-15 21:49:19,163 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 25 [2023-12-15 21:49:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:19,163 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2023-12-15 21:49:19,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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) [2023-12-15 21:49:19,163 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2023-12-15 21:49:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 21:49:19,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:19,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:19,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 21:49:19,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:19,369 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:19,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1436644313, now seen corresponding path program 1 times [2023-12-15 21:49:19,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:19,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976930871] [2023-12-15 21:49:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:19,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-15 21:49:19,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:19,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976930871] [2023-12-15 21:49:19,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976930871] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:49:19,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:49:19,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:49:19,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371163163] [2023-12-15 21:49:19,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:49:19,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:49:19,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:19,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:49:19,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:49:19,473 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:49:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:19,513 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2023-12-15 21:49:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:49:19,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-15 21:49:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:19,514 INFO L225 Difference]: With dead ends: 74 [2023-12-15 21:49:19,514 INFO L226 Difference]: Without dead ends: 57 [2023-12-15 21:49:19,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:49:19,514 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:19,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 63 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:49:19,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-15 21:49:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2023-12-15 21:49:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:49:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2023-12-15 21:49:19,519 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 26 [2023-12-15 21:49:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:19,530 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2023-12-15 21:49:19,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:49:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2023-12-15 21:49:19,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 21:49:19,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:19,531 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:19,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:49:19,531 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:19,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1062138715, now seen corresponding path program 2 times [2023-12-15 21:49:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:19,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013886640] [2023-12-15 21:49:19,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:19,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 21:49:19,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:19,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013886640] [2023-12-15 21:49:19,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013886640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:49:19,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:49:19,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:49:19,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191538054] [2023-12-15 21:49:19,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:49:19,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:49:19,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:19,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:49:19,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:49:19,555 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2023-12-15 21:49:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:49:19,566 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2023-12-15 21:49:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:49:19,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) Word has length 31 [2023-12-15 21:49:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:49:19,566 INFO L225 Difference]: With dead ends: 103 [2023-12-15 21:49:19,566 INFO L226 Difference]: Without dead ends: 59 [2023-12-15 21:49:19,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:49:19,567 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:49:19,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 65 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:49:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-15 21:49:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2023-12-15 21:49:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 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) [2023-12-15 21:49:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2023-12-15 21:49:19,571 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 31 [2023-12-15 21:49:19,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:49:19,571 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2023-12-15 21:49:19,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2023-12-15 21:49:19,571 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2023-12-15 21:49:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 21:49:19,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:49:19,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:49:19,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:49:19,572 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:49:19,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:49:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash 244490265, now seen corresponding path program 1 times [2023-12-15 21:49:19,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:49:19,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559977613] [2023-12-15 21:49:19,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:19,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:49:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:20,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:49:20,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559977613] [2023-12-15 21:49:20,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559977613] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:49:20,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054117627] [2023-12-15 21:49:20,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:49:20,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:49:20,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:49:20,156 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:49:20,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 21:49:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:49:20,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-15 21:49:20,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:49:20,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:49:20,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:49:20,351 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:49:20,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-15 21:49:20,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-15 21:49:20,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:49:20,421 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:49:20,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-15 21:49:20,432 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-15 21:49:20,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2023-12-15 21:49:20,494 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:49:20,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2023-12-15 21:49:20,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-15 21:49:20,548 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:49:20,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-12-15 21:49:20,558 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-15 21:49:20,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-12-15 21:49:20,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:20,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-15 21:49:20,806 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:49:20,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 21 [2023-12-15 21:49:20,877 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-15 21:49:20,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2023-12-15 21:49:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:49:20,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:49:20,936 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) 1)) is different from false [2023-12-15 21:49:20,978 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) 1) (not (= v_ArrVal_537 (let ((.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base|) .cse0 (select v_ArrVal_537 .cse0))))))) is different from false [2023-12-15 21:49:20,989 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_537 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_537 .cse0)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_537) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_538) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)))) (= 3 |c_ULTIMATE.start_main_#t~mem8#1|)) is different from false [2023-12-15 21:49:20,997 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|))) (or (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_537 (store .cse0 .cse1 (select v_ArrVal_537 .cse1)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_537) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1) v_ArrVal_538) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)))) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) 3))) is different from false [2023-12-15 21:49:21,005 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse0 .cse1 (select v_ArrVal_537 .cse1))))))))) is different from false [2023-12-15 21:49:21,022 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse1 (store |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse0 .cse2 (select v_ArrVal_537 .cse2))))))))))) is different from false [2023-12-15 21:49:21,053 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_532))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_59|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (not (= v_ArrVal_537 (store .cse0 .cse1 (select v_ArrVal_537 .cse1)))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_533) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_535) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))) is different from false [2023-12-15 21:49:21,075 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_532))) (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse3 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (not (= v_ArrVal_537 (store .cse0 .cse1 (select v_ArrVal_537 .cse1)))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_533) |v_ULTIMATE.start_main_~p~0#1.base_59| v_ArrVal_535) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))) is different from false [2023-12-15 21:49:21,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:21,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 70 [2023-12-15 21:49:21,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:21,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 245 [2023-12-15 21:49:21,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 112 [2023-12-15 21:49:21,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 218 [2023-12-15 21:49:22,102 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse25 (and (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse39 (let ((.cse40 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse40 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse40 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse37 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse38 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (not (= v_ArrVal_537 (store .cse37 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store .cse38 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse38 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))) (or .cse15 (and (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse43 (let ((.cse44 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse44 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse44 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse41 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse41 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse42 (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse42 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse42 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))) (= (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse46 (let ((.cse47 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse47 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse47 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse45 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse49 (let ((.cse51 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse51 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse51 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_537 (Array Int Int))) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse48 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse48 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse48 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (not (= v_ArrVal_537 (store .cse50 .cse2 (select v_ArrVal_537 .cse2)))))) (= (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))))) (and (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse1 (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3)) (.cse0 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse0 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= v_ArrVal_537 (store .cse1 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store .cse0 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)))) (let ((.cse10 (store .cse8 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse9 (store (select .cse10 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse7 (store .cse10 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse9))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse6 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int))) (or (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store (store (store .cse8 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse9) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)))) (let ((.cse14 (store .cse12 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse13 (store (select .cse14 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse11 (select (store .cse14 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse11 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store (store .cse12 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse13) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))))) .cse15) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse16 (store (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (not (= v_ArrVal_537 (store .cse16 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (or (not .cse15) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse20 (let ((.cse21 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse21 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse21 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse18 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (forall ((v_arrayElimCell_41 Int)) (= (select (select (store .cse19 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse19 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse23 (let ((.cse24 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (store .cse24 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse24 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse22 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store .cse23 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))))) (or .cse25 (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)))) (let ((.cse30 (store .cse28 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse29 (store (select .cse30 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse27 (store .cse30 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse29))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse26 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store .cse27 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store (store (store .cse28 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse29) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (= (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) 3)))))))) (or .cse25 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse4 .cse5 v_ArrVal_526)))) (let ((.cse36 (store .cse33 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_532))) (let ((.cse34 (store (select .cse36 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse35 (store .cse36 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse34))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse31 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse32 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse32 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse32 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store (store (store .cse33 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse34) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))) (= (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) 3))))))))))) is different from false [2023-12-15 21:49:25,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:25,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 120 [2023-12-15 21:49:25,797 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:25,844 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2023-12-15 21:49:25,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 248 treesize of output 273 [2023-12-15 21:49:25,883 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-12-15 21:49:25,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 144 [2023-12-15 21:49:25,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:25,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:25,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 60 [2023-12-15 21:49:25,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-12-15 21:49:26,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:26,129 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-15 21:49:26,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:26,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-12-15 21:49:26,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:26,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-12-15 21:49:26,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:26,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:26,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2023-12-15 21:49:26,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:26,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 259 treesize of output 147 [2023-12-15 21:49:26,428 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2023-12-15 21:49:26,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 480 treesize of output 501 [2023-12-15 21:49:26,474 INFO L349 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2023-12-15 21:49:26,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 320 treesize of output 331 [2023-12-15 21:49:26,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:26,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 75 [2023-12-15 21:49:26,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 136 [2023-12-15 21:49:26,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:26,760 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2023-12-15 21:49:26,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 30 [2023-12-15 21:49:26,800 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-15 21:49:26,826 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2023-12-15 21:49:26,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 30 [2023-12-15 21:49:27,005 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2023-12-15 21:49:27,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 30 [2023-12-15 21:49:27,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 116 [2023-12-15 21:49:27,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-15 21:49:27,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2023-12-15 21:49:27,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2023-12-15 21:49:27,204 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:49:27,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 1 [2023-12-15 21:49:27,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 209 treesize of output 123 [2023-12-15 21:49:27,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:27,225 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:27,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 160 [2023-12-15 21:49:27,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:27,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 91 [2023-12-15 21:49:27,246 INFO L349 Elim1Store]: treesize reduction 13, result has 31.6 percent of original size [2023-12-15 21:49:27,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 40 [2023-12-15 21:49:27,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-15 21:49:27,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 96 [2023-12-15 21:49:27,295 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:27,295 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:27,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 111 [2023-12-15 21:49:27,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-12-15 21:49:27,313 INFO L349 Elim1Store]: treesize reduction 13, result has 31.6 percent of original size [2023-12-15 21:49:27,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 40 [2023-12-15 21:49:27,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-12-15 21:49:27,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:27,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 262 treesize of output 150 [2023-12-15 21:49:27,405 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:27,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 311 treesize of output 313 [2023-12-15 21:49:27,465 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-12-15 21:49:27,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 144 [2023-12-15 21:49:27,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 136 [2023-12-15 21:49:27,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:27,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-12-15 21:49:27,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-12-15 21:49:27,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:27,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-15 21:49:27,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 209 treesize of output 123 [2023-12-15 21:49:27,701 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:27,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 262 treesize of output 264 [2023-12-15 21:49:27,749 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-12-15 21:49:27,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 144 [2023-12-15 21:49:27,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 91 [2023-12-15 21:49:27,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:27,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-12-15 21:49:27,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-12-15 21:49:27,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:27,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2023-12-15 21:49:27,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 69 [2023-12-15 21:49:27,949 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:27,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2023-12-15 21:49:27,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-15 21:49:27,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:27,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:27,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2023-12-15 21:49:28,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 209 treesize of output 123 [2023-12-15 21:49:28,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,007 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 168 [2023-12-15 21:49:28,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 91 [2023-12-15 21:49:28,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:28,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-15 21:49:28,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 96 [2023-12-15 21:49:28,078 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,078 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 121 treesize of output 119 [2023-12-15 21:49:28,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-12-15 21:49:28,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:28,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-15 21:49:28,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 262 treesize of output 150 [2023-12-15 21:49:28,136 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 311 treesize of output 321 [2023-12-15 21:49:28,189 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-12-15 21:49:28,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 144 [2023-12-15 21:49:28,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 136 [2023-12-15 21:49:28,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:28,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-12-15 21:49:28,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-12-15 21:49:28,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:28,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-12-15 21:49:28,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 209 treesize of output 123 [2023-12-15 21:49:28,444 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 272 [2023-12-15 21:49:28,492 INFO L349 Elim1Store]: treesize reduction 26, result has 58.7 percent of original size [2023-12-15 21:49:28,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 144 [2023-12-15 21:49:28,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 91 [2023-12-15 21:49:28,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:28,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-12-15 21:49:28,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-12-15 21:49:28,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:28,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2023-12-15 21:49:28,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 120 [2023-12-15 21:49:28,722 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,722 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,745 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2023-12-15 21:49:28,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 156 treesize of output 172 [2023-12-15 21:49:28,752 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2023-12-15 21:49:28,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-12-15 21:49:28,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:28,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2023-12-15 21:49:28,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 85 [2023-12-15 21:49:28,844 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 77 [2023-12-15 21:49:28,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-12-15 21:49:28,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:28,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2023-12-15 21:49:28,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 93 [2023-12-15 21:49:28,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,910 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2023-12-15 21:49:28,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 123 [2023-12-15 21:49:28,915 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:49:28,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:28,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2023-12-15 21:49:28,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:28,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-15 21:49:28,968 INFO L349 Elim1Store]: treesize reduction 36, result has 35.7 percent of original size [2023-12-15 21:49:28,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 65 [2023-12-15 21:49:29,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:49:29,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2023-12-15 21:49:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2023-12-15 21:49:38,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054117627] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:49:38,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:49:38,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 44 [2023-12-15 21:49:38,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997037567] [2023-12-15 21:49:38,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:49:38,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-15 21:49:38,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:49:38,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-15 21:49:38,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1124, Unknown=26, NotChecked=684, Total=1980 [2023-12-15 21:49:38,096 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 45 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 44 states have internal predecessors, (84), 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) [2023-12-15 21:49:52,124 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse20 (select .cse6 0)) (.cse22 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse44 (let ((.cse45 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (store .cse45 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse45 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse43 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse43 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse48 (let ((.cse49 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (store .cse49 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse49 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse46 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse47 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse47 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse47 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse47 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (not (= v_ArrVal_537 (store .cse46 .cse2 (select v_ArrVal_537 .cse2)))))))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse52 (let ((.cse53 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (store .cse53 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse53 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse51 (store .cse52 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse51 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse50 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store .cse51 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((v_arrayElimCell_38 Int) (|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse56 (let ((.cse57 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (store .cse57 |v_ULTIMATE.start_main_~p~0#1.base_59| (store (select .cse57 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))))) (let ((.cse54 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse54 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse55 (store .cse56 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse55 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse55 v_arrayElimCell_38 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))))) (.cse21 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse23 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse0 1) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse5 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse4 (store (select .cse5 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse1 (select (store .cse5 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse1 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store (store .cse3 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse4) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse13 (store .cse10 |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse11 (store (select .cse13 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse12 (store .cse13 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse11))) (let ((.cse8 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse8 .cse2 (select v_ArrVal_537 .cse2)))) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse9 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (= (select (select (store .cse9 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse9 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store (store (store .cse10 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse11) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_41 Int) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537)) (.cse15 (store (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store .cse14 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store .cse14 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse15 .cse2 (select v_ArrVal_537 .cse2)))) (= 3 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) 0 3))) (or (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse18 .cse2 (select v_ArrVal_537 .cse2)))) (= 3 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (let ((.cse19 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) 0))) (or (and (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4) |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((|ULTIMATE.start_main_~p~0#1.base| Int)) (= (select (select |c_#memory_int#1| |ULTIMATE.start_main_~p~0#1.base|) 0) 3)) (= .cse19 1)) (= .cse19 3))) (or (= 3 .cse20) (and (not (= (select .cse21 4) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse20 1) (exists ((v_subst_1 Int)) (= 3 (select (select |c_#memory_int#1| v_subst_1) 0))))) (= .cse20 |c_ULTIMATE.start_main_#t~mem8#1|) (= |c_ULTIMATE.start_main_~flag~0#1| .cse0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse22 .cse23) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse22) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (= |v_ULTIMATE.start_main_~t~0#1.base_29| |c_ULTIMATE.start_main_~a~0#1.base|) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse26 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse28 (store .cse26 |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse27 (store (select .cse28 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse25 (store .cse28 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse27))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int))) (or (forall ((v_arrayElimCell_41 Int) (v_ArrVal_538 (Array Int Int))) (or (= (select (select (store (store .cse25 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select (select (store (store (store .cse26 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse27) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (not (= v_ArrVal_537 (store .cse24 .cse2 (select v_ArrVal_537 .cse2))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (or (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int))) (or (not (= v_ArrVal_537 (store .cse6 .cse7 (select v_ArrVal_537 .cse7)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_537) (select .cse21 .cse7) v_ArrVal_538) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1))) (= 3 |c_ULTIMATE.start_main_#t~mem8#1|)) (or (and (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse32 (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_532))) (let ((.cse31 (store (select .cse32 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse29 (select (store .cse32 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse31) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= 3 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (or (= (select (select (store (store (store .cse30 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse31) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (store .cse29 .cse2 (select v_ArrVal_537 .cse2)) v_ArrVal_537)))))))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse37 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_532))) (let ((.cse36 (store (select .cse37 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse33 (select (store .cse37 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse36) |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= 3 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_537 (Array Int Int))) (or (not (= (store .cse33 .cse2 (select v_ArrVal_537 .cse2)) v_ArrVal_537)) (forall ((v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (let ((.cse34 (store (store .cse35 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse36) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537))) (or (forall ((v_arrayElimCell_41 Int)) (= (select (select (store .cse34 v_arrayElimCell_41 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select (store .cse34 v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))))))))))) (not (= .cse0 0))) .cse23 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_29| Int)) (or (forall ((|v_ULTIMATE.start_main_~p~0#1.base_59| Int) (v_ArrVal_526 Int) (v_ArrVal_532 (Array Int Int))) (let ((.cse40 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse6 .cse7 v_ArrVal_526)))) (let ((.cse42 (store .cse40 |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_532))) (let ((.cse41 (store (select .cse42 |v_ULTIMATE.start_main_~p~0#1.base_59|) 0 3))) (let ((.cse39 (store .cse42 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse41))) (let ((.cse38 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= |v_ULTIMATE.start_main_~p~0#1.base_59| |c_ULTIMATE.start_main_~a~0#1.base|) (= (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) 3) (forall ((v_ArrVal_537 (Array Int Int)) (v_arrayElimCell_40 Int) (v_ArrVal_538 (Array Int Int))) (or (= (select (select (store (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) v_arrayElimCell_40 v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_537 (store .cse38 .cse2 (select v_ArrVal_537 .cse2)))) (= (select (select (store (store (store .cse40 |v_ULTIMATE.start_main_~p~0#1.base_59| .cse41) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_537) |v_ULTIMATE.start_main_~t~0#1.base_29| v_ArrVal_538) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_29|) 0))))))) is different from true [2023-12-15 21:50:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:00,307 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2023-12-15 21:50:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:50:00,307 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 44 states have internal predecessors, (84), 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) Word has length 31 [2023-12-15 21:50:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:00,309 INFO L225 Difference]: With dead ends: 106 [2023-12-15 21:50:00,309 INFO L226 Difference]: Without dead ends: 104 [2023-12-15 21:50:00,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=304, Invalid=2361, Unknown=27, NotChecked=1090, Total=3782 [2023-12-15 21:50:00,311 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 191 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 956 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:00,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 390 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 673 Invalid, 0 Unknown, 956 Unchecked, 4.4s Time] [2023-12-15 21:50:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-15 21:50:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 68. [2023-12-15 21:50:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-12-15 21:50:00,315 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 31 [2023-12-15 21:50:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:00,315 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-12-15 21:50:00,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 44 states have internal predecessors, (84), 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) [2023-12-15 21:50:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-12-15 21:50:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 21:50:00,316 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:00,316 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:00,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 21:50:00,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:00,521 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:50:00,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:00,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1268022284, now seen corresponding path program 1 times [2023-12-15 21:50:00,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:00,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273852169] [2023-12-15 21:50:00,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:00,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:01,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:01,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273852169] [2023-12-15 21:50:01,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273852169] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:01,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450862771] [2023-12-15 21:50:01,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:01,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:01,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:01,302 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:50:01,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-15 21:50:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:01,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-15 21:50:01,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:01,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-15 21:50:01,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-15 21:50:01,519 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-15 21:50:01,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-12-15 21:50:01,534 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-15 21:50:01,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-12-15 21:50:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-15 21:50:01,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:50:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-15 21:50:01,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450862771] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:50:01,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:50:01,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 24 [2023-12-15 21:50:01,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767280150] [2023-12-15 21:50:01,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:50:01,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-15 21:50:01,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:01,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-15 21:50:01,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2023-12-15 21:50:01,882 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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) [2023-12-15 21:50:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:02,488 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2023-12-15 21:50:02,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-15 21:50:02,488 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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) Word has length 33 [2023-12-15 21:50:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:02,489 INFO L225 Difference]: With dead ends: 96 [2023-12-15 21:50:02,489 INFO L226 Difference]: Without dead ends: 89 [2023-12-15 21:50:02,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=1170, Unknown=0, NotChecked=0, Total=1332 [2023-12-15 21:50:02,490 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:02,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 205 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:50:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-15 21:50:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2023-12-15 21:50:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 69 states have internal predecessors, (80), 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) [2023-12-15 21:50:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2023-12-15 21:50:02,495 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 33 [2023-12-15 21:50:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:02,495 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2023-12-15 21:50:02,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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) [2023-12-15 21:50:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2023-12-15 21:50:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-15 21:50:02,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:02,496 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:02,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-15 21:50:02,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:02,701 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:50:02,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash 202694188, now seen corresponding path program 2 times [2023-12-15 21:50:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:02,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119502304] [2023-12-15 21:50:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:03,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:03,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119502304] [2023-12-15 21:50:03,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119502304] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:03,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288982487] [2023-12-15 21:50:03,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 21:50:03,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:03,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:03,546 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:50:03,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-15 21:50:03,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 21:50:03,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 21:50:03,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-15 21:50:03,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:03,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-15 21:50:03,732 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:50:03,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:50:03,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:50:03,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-15 21:50:03,849 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:50:03,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-12-15 21:50:03,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-15 21:50:03,866 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-12-15 21:50:03,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2023-12-15 21:50:03,914 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-15 21:50:03,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-15 21:50:03,990 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2023-12-15 21:50:03,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 109 [2023-12-15 21:50:03,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2023-12-15 21:50:04,104 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-15 21:50:04,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 140 [2023-12-15 21:50:04,128 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-12-15 21:50:04,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 129 [2023-12-15 21:50:04,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-12-15 21:50:04,342 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-15 21:50:04,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 66 [2023-12-15 21:50:04,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2023-12-15 21:50:04,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47 [2023-12-15 21:50:04,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-12-15 21:50:04,374 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2023-12-15 21:50:04,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 33 [2023-12-15 21:50:04,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-15 21:50:04,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-15 21:50:04,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-15 21:50:04,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-15 21:50:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:04,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:50:08,697 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2) 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_762) .cse0 v_ArrVal_765) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_763) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_764) .cse0) .cse1)))) 3)) is different from false [2023-12-15 21:50:08,810 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2023-12-15 21:50:08,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 119 [2023-12-15 21:50:08,843 INFO L349 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2023-12-15 21:50:08,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 903 treesize of output 909 [2023-12-15 21:50:08,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 120 [2023-12-15 21:50:08,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 119 [2023-12-15 21:50:11,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-12-15 21:50:11,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2023-12-15 21:50:11,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 126 [2023-12-15 21:50:11,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2023-12-15 21:50:11,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-12-15 21:50:11,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2023-12-15 21:50:11,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 116 [2023-12-15 21:50:11,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 134 [2023-12-15 21:50:11,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 103 [2023-12-15 21:50:11,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 93 [2023-12-15 21:50:11,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 126 [2023-12-15 21:50:11,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 106 [2023-12-15 21:50:11,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 109 [2023-12-15 21:50:11,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 118 [2023-12-15 21:50:11,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 108 [2023-12-15 21:50:11,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 93 [2023-12-15 21:50:11,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-12-15 21:50:11,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2023-12-15 21:50:11,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-12-15 21:50:11,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2023-12-15 21:50:11,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 109 [2023-12-15 21:50:11,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 118 [2023-12-15 21:50:11,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 108 [2023-12-15 21:50:11,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 93 [2023-12-15 21:50:11,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 103 [2023-12-15 21:50:11,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 93 [2023-12-15 21:50:11,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 116 [2023-12-15 21:50:11,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:11,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 134 [2023-12-15 21:50:19,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:19,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 176 [2023-12-15 21:50:19,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:19,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 6301 treesize of output 5046 [2023-12-15 21:50:19,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:19,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1442 treesize of output 1052 [2023-12-15 21:50:19,427 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:50:19,676 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2023-12-15 21:50:19,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 8574 treesize of output 5983 [2023-12-15 21:50:19,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:19,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 960 treesize of output 916 [2023-12-15 21:50:19,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:19,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 378 treesize of output 379 [2023-12-15 21:50:20,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:20,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 963 treesize of output 751 [2023-12-15 21:50:20,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:20,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 223 [2023-12-15 21:50:20,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:20,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 214 [2023-12-15 21:50:20,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:20,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 292 treesize of output 296 Received shutdown request... [2023-12-15 21:50:21,488 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:50:21,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 21:50:21,514 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:50:21,517 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:50:21,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-15 21:50:21,694 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-41-4-4-4-4-2-2-2-1 context. [2023-12-15 21:50:21,697 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:21,699 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:50:21,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:50:21 BoogieIcfgContainer [2023-12-15 21:50:21,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:50:21,700 INFO L158 Benchmark]: Toolchain (without parser) took 69628.06ms. Allocated memory was 250.6MB in the beginning and 521.1MB in the end (delta: 270.5MB). Free memory was 195.6MB in the beginning and 380.4MB in the end (delta: -184.8MB). Peak memory consumption was 296.6MB. Max. memory is 8.0GB. [2023-12-15 21:50:21,700 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 208.7MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:50:21,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.80ms. Allocated memory is still 250.6MB. Free memory was 195.6MB in the beginning and 177.8MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 21:50:21,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.40ms. Allocated memory is still 250.6MB. Free memory was 177.8MB in the beginning and 175.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:50:21,701 INFO L158 Benchmark]: Boogie Preprocessor took 35.80ms. Allocated memory is still 250.6MB. Free memory was 175.7MB in the beginning and 173.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:50:21,701 INFO L158 Benchmark]: RCFGBuilder took 389.03ms. Allocated memory is still 250.6MB. Free memory was 172.6MB in the beginning and 157.5MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:50:21,701 INFO L158 Benchmark]: TraceAbstraction took 68813.96ms. Allocated memory was 250.6MB in the beginning and 521.1MB in the end (delta: 270.5MB). Free memory was 156.9MB in the beginning and 380.4MB in the end (delta: -223.5MB). Peak memory consumption was 257.8MB. Max. memory is 8.0GB. [2023-12-15 21:50:21,701 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 208.7MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 350.80ms. Allocated memory is still 250.6MB. Free memory was 195.6MB in the beginning and 177.8MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.40ms. Allocated memory is still 250.6MB. Free memory was 177.8MB in the beginning and 175.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.80ms. Allocated memory is still 250.6MB. Free memory was 175.7MB in the beginning and 173.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 389.03ms. Allocated memory is still 250.6MB. Free memory was 172.6MB in the beginning and 157.5MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 68813.96ms. Allocated memory was 250.6MB in the beginning and 521.1MB in the end (delta: 270.5MB). Free memory was 156.9MB in the beginning and 380.4MB in the end (delta: -223.5MB). Peak memory consumption was 257.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 584]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 584). Cancelled while NwaCegarLoop was analyzing trace of length 35 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-41-4-4-4-4-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.8s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 833 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 833 mSDsluCounter, 1610 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1148 IncrementalHoareTripleChecker+Unchecked, 1301 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2380 IncrementalHoareTripleChecker+Invalid, 3694 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 309 mSDtfsCounter, 2380 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 279 SyntacticMatches, 4 SemanticMatches, 222 ConstructedPredicates, 12 IntricatePredicates, 3 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 32.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=12, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 160 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 596 ConstructedInterpolants, 56 QuantifiedInterpolants, 14868 SizeOfPredicates, 71 NumberOfNonLiveVariables, 1329 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 76/209 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown