/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/heap-data/cart.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 17:15:08,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 17:15:08,081 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-19 17:15:08,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 17:15:08,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 17:15:08,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 17:15:08,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 17:15:08,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 17:15:08,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 17:15:08,121 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 17:15:08,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 17:15:08,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 17:15:08,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 17:15:08,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 17:15:08,123 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 17:15:08,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 17:15:08,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 17:15:08,123 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 17:15:08,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 17:15:08,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 17:15:08,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 17:15:08,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 17:15:08,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 17:15:08,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 17:15:08,125 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 17:15:08,125 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 17:15:08,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 17:15:08,126 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 17:15:08,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 17:15:08,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 17:15:08,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 17:15:08,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 17:15:08,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:15:08,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 17:15:08,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 17:15:08,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 17:15:08,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 17:15:08,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 17:15:08,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 17:15:08,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 17:15:08,129 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 17:15:08,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 17:15:08,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 17:15:08,129 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-19 17:15:08,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 17:15:08,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 17:15:08,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 17:15:08,307 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 17:15:08,307 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 17:15:08,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/cart.i [2023-12-19 17:15:09,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 17:15:09,543 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 17:15:09,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/cart.i [2023-12-19 17:15:09,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84dbf96e9/eb57cfca0ebc43d5a00ea7af6a94a584/FLAGcda238aa4 [2023-12-19 17:15:09,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84dbf96e9/eb57cfca0ebc43d5a00ea7af6a94a584 [2023-12-19 17:15:09,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 17:15:09,572 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 17:15:09,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 17:15:09,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 17:15:09,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 17:15:09,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46c1b2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09, skipping insertion in model container [2023-12-19 17:15:09,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,602 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 17:15:09,769 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-data/cart.i[23713,23726] [2023-12-19 17:15:09,774 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:15:09,784 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 17:15:09,834 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-data/cart.i[23713,23726] [2023-12-19 17:15:09,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 17:15:09,858 INFO L206 MainTranslator]: Completed translation [2023-12-19 17:15:09,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09 WrapperNode [2023-12-19 17:15:09,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 17:15:09,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 17:15:09,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 17:15:09,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 17:15:09,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,908 INFO L138 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-12-19 17:15:09,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 17:15:09,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 17:15:09,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 17:15:09,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 17:15:09,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,947 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2023-12-19 17:15:09,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 17:15:09,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 17:15:09,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 17:15:09,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 17:15:09,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (1/1) ... [2023-12-19 17:15:09,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 17:15:09,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:15:09,999 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-19 17:15:10,002 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-19 17:15:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 17:15:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 17:15:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 17:15:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 17:15:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 17:15:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 17:15:10,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-19 17:15:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 17:15:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-19 17:15:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-19 17:15:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-19 17:15:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-19 17:15:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-19 17:15:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-19 17:15:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 17:15:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 17:15:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 17:15:10,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 17:15:10,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 17:15:10,112 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 17:15:10,113 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 17:15:10,206 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 17:15:10,219 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 17:15:10,219 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-19 17:15:10,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:15:10 BoogieIcfgContainer [2023-12-19 17:15:10,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 17:15:10,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 17:15:10,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 17:15:10,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 17:15:10,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:15:09" (1/3) ... [2023-12-19 17:15:10,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dad47c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:15:10, skipping insertion in model container [2023-12-19 17:15:10,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:15:09" (2/3) ... [2023-12-19 17:15:10,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dad47c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:15:10, skipping insertion in model container [2023-12-19 17:15:10,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:15:10" (3/3) ... [2023-12-19 17:15:10,224 INFO L112 eAbstractionObserver]: Analyzing ICFG cart.i [2023-12-19 17:15:10,235 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 17:15:10,236 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 17:15:10,262 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 17:15:10,266 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;@3a3bb7fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 17:15:10,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 17:15:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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-19 17:15:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-19 17:15:10,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:15:10,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:15:10,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:15:10,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:15:10,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1487606993, now seen corresponding path program 1 times [2023-12-19 17:15:10,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:15:10,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961513300] [2023-12-19 17:15:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:10,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:15:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:10,434 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-19 17:15:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:15:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961513300] [2023-12-19 17:15:10,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961513300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:15:10,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:15:10,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 17:15:10,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933294055] [2023-12-19 17:15:10,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:15:10,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 17:15:10,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:15:10,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 17:15:10,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 17:15:10,459 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-19 17:15:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:15:10,478 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. [2023-12-19 17:15:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 17:15:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-12-19 17:15:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:15:10,484 INFO L225 Difference]: With dead ends: 31 [2023-12-19 17:15:10,484 INFO L226 Difference]: Without dead ends: 16 [2023-12-19 17:15:10,486 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-19 17:15:10,488 INFO L413 NwaCegarLoop]: 21 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, 21 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-19 17:15:10,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:15:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-19 17:15:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-19 17:15:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 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-19 17:15:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2023-12-19 17:15:10,508 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 8 [2023-12-19 17:15:10,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:15:10,508 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2023-12-19 17:15:10,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-19 17:15:10,508 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2023-12-19 17:15:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-19 17:15:10,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:15:10,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:15:10,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 17:15:10,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:15:10,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:15:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2098913187, now seen corresponding path program 1 times [2023-12-19 17:15:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:15:10,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031660615] [2023-12-19 17:15:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:10,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:15:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:10,628 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-19 17:15:10,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:15:10,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031660615] [2023-12-19 17:15:10,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031660615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:15:10,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:15:10,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 17:15:10,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351444744] [2023-12-19 17:15:10,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:15:10,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 17:15:10,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:15:10,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 17:15:10,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:15:10,634 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-19 17:15:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:15:10,693 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-12-19 17:15:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 17:15:10,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-19 17:15:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:15:10,694 INFO L225 Difference]: With dead ends: 35 [2023-12-19 17:15:10,694 INFO L226 Difference]: Without dead ends: 20 [2023-12-19 17:15:10,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-19 17:15:10,695 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:15:10,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:15:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-19 17:15:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-19 17:15:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-19 17:15:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2023-12-19 17:15:10,698 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 11 [2023-12-19 17:15:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:15:10,699 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2023-12-19 17:15:10,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-19 17:15:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2023-12-19 17:15:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-19 17:15:10,699 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:15:10,699 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:15:10,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 17:15:10,700 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:15:10,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:15:10,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2087693085, now seen corresponding path program 1 times [2023-12-19 17:15:10,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:15:10,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699389629] [2023-12-19 17:15:10,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:10,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:15:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:10,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:15:10,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699389629] [2023-12-19 17:15:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699389629] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:15:10,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:15:10,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 17:15:10,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955565992] [2023-12-19 17:15:10,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:15:10,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 17:15:10,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:15:10,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 17:15:10,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:15:10,829 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-19 17:15:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:15:10,905 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2023-12-19 17:15:10,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 17:15:10,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2023-12-19 17:15:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:15:10,907 INFO L225 Difference]: With dead ends: 35 [2023-12-19 17:15:10,907 INFO L226 Difference]: Without dead ends: 29 [2023-12-19 17:15:10,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 17:15:10,908 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:15:10,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:15:10,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-19 17:15:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-12-19 17:15:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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-19 17:15:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2023-12-19 17:15:10,912 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 15 [2023-12-19 17:15:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:15:10,912 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2023-12-19 17:15:10,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-19 17:15:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2023-12-19 17:15:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-19 17:15:10,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:15:10,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:15:10,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 17:15:10,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:15:10,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:15:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1239572016, now seen corresponding path program 1 times [2023-12-19 17:15:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:15:10,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107528842] [2023-12-19 17:15:10,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:15:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:15:11,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:15:11,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107528842] [2023-12-19 17:15:11,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107528842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 17:15:11,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 17:15:11,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 17:15:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110682698] [2023-12-19 17:15:11,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 17:15:11,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 17:15:11,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:15:11,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 17:15:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 17:15:11,018 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-19 17:15:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:15:11,028 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2023-12-19 17:15:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 17:15:11,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-19 17:15:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:15:11,029 INFO L225 Difference]: With dead ends: 36 [2023-12-19 17:15:11,029 INFO L226 Difference]: Without dead ends: 26 [2023-12-19 17:15:11,030 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-19 17:15:11,030 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 17:15:11,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 17:15:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-19 17:15:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-19 17:15:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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-19 17:15:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-12-19 17:15:11,034 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2023-12-19 17:15:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:15:11,034 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-12-19 17:15:11,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-19 17:15:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-12-19 17:15:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-19 17:15:11,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:15:11,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:15:11,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 17:15:11,035 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:15:11,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:15:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash 430225390, now seen corresponding path program 1 times [2023-12-19 17:15:11,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:15:11,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279165692] [2023-12-19 17:15:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:11,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:15:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:11,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:15:11,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279165692] [2023-12-19 17:15:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279165692] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:15:11,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174643388] [2023-12-19 17:15:11,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:11,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:11,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:15:11,449 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-19 17:15:11,487 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-19 17:15:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:11,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-19 17:15:11,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:15:11,668 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 45 treesize of output 15 [2023-12-19 17:15:11,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:11,695 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 26 treesize of output 10 [2023-12-19 17:15:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:11,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:15:11,826 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-19 17:15:11,826 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 1596 treesize of output 1405 [2023-12-19 17:15:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:15:11,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174643388] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:15:11,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:15:11,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2023-12-19 17:15:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765514293] [2023-12-19 17:15:11,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:15:11,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 17:15:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:15:11,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 17:15:11,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-19 17:15:11,956 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 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-19 17:15:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:15:12,156 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2023-12-19 17:15:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 17:15:12,157 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 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) Word has length 19 [2023-12-19 17:15:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:15:12,158 INFO L225 Difference]: With dead ends: 47 [2023-12-19 17:15:12,158 INFO L226 Difference]: Without dead ends: 45 [2023-12-19 17:15:12,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-12-19 17:15:12,162 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:15:12,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 117 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 17:15:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-19 17:15:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2023-12-19 17:15:12,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 17:15:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-12-19 17:15:12,174 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 19 [2023-12-19 17:15:12,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:15:12,174 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-12-19 17:15:12,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 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-19 17:15:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2023-12-19 17:15:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-19 17:15:12,176 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:15:12,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:15:12,183 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-19 17:15:12,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:12,381 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:15:12,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:15:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash 666078984, now seen corresponding path program 1 times [2023-12-19 17:15:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:15:12,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564115090] [2023-12-19 17:15:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:15:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:15:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:15:12,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564115090] [2023-12-19 17:15:12,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564115090] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:15:12,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917570759] [2023-12-19 17:15:12,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:12,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:12,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:15:12,518 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-19 17:15:12,536 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-19 17:15:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:12,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-19 17:15:12,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:15:12,700 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 8 treesize of output 1 [2023-12-19 17:15:12,705 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 8 treesize of output 1 [2023-12-19 17:15:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:12,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:15:12,818 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 29 [2023-12-19 17:15:12,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:12,826 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 40 [2023-12-19 17:15:12,835 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 39 treesize of output 35 [2023-12-19 17:15:12,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:12,842 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 42 treesize of output 46 [2023-12-19 17:15:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:15:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917570759] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:15:12,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:15:12,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2023-12-19 17:15:12,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584333647] [2023-12-19 17:15:12,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:15:12,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 17:15:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:15:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 17:15:12,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-19 17:15:12,870 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-19 17:15:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:15:13,033 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2023-12-19 17:15:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 17:15:13,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-19 17:15:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:15:13,034 INFO L225 Difference]: With dead ends: 58 [2023-12-19 17:15:13,034 INFO L226 Difference]: Without dead ends: 48 [2023-12-19 17:15:13,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-12-19 17:15:13,035 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 79 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:15:13,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 114 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 17:15:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-19 17:15:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2023-12-19 17:15:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 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-19 17:15:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-12-19 17:15:13,039 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 22 [2023-12-19 17:15:13,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:15:13,039 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-12-19 17:15:13,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 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-19 17:15:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-12-19 17:15:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-19 17:15:13,040 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:15:13,040 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:15:13,047 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-19 17:15:13,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-19 17:15:13,245 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:15:13,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:15:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash -110453383, now seen corresponding path program 2 times [2023-12-19 17:15:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:15:13,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882568664] [2023-12-19 17:15:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:15:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:13,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:15:13,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882568664] [2023-12-19 17:15:13,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882568664] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:15:13,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251251863] [2023-12-19 17:15:13,452 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:15:13,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:13,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:15:13,453 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-19 17:15:13,478 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-19 17:15:13,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:15:13,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:15:13,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-19 17:15:13,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:15:13,576 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-19 17:15:13,579 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-19 17:15:13,632 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 18 treesize of output 14 [2023-12-19 17:15:13,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-12-19 17:15:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:13,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:15:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:13,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251251863] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:15:13,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:15:13,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-12-19 17:15:13,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418110726] [2023-12-19 17:15:13,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:15:13,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 17:15:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:15:13,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 17:15:13,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-19 17:15:13,701 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 17:15:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:15:13,782 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2023-12-19 17:15:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 17:15:13,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-19 17:15:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:15:13,783 INFO L225 Difference]: With dead ends: 66 [2023-12-19 17:15:13,783 INFO L226 Difference]: Without dead ends: 39 [2023-12-19 17:15:13,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-19 17:15:13,784 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 17:15:13,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 17:15:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-19 17:15:13,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-19 17:15:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 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-19 17:15:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-12-19 17:15:13,787 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 23 [2023-12-19 17:15:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:15:13,787 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-12-19 17:15:13,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 17:15:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2023-12-19 17:15:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-19 17:15:13,788 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:15:13,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:15:13,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 17:15:13,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:13,997 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:15:13,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:15:13,998 INFO L85 PathProgramCache]: Analyzing trace with hash -948094721, now seen corresponding path program 3 times [2023-12-19 17:15:13,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:15:13,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142155755] [2023-12-19 17:15:13,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:13,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:15:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:14,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:15:14,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142155755] [2023-12-19 17:15:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142155755] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:15:14,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461169934] [2023-12-19 17:15:14,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 17:15:14,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:14,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:15:14,513 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-19 17:15:14,528 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-19 17:15:14,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-19 17:15:14,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:15:14,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-19 17:15:14,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:15:14,667 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-19 17:15:14,758 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 8 treesize of output 1 [2023-12-19 17:15:14,765 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-19 17:15:14,770 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 45 treesize of output 15 [2023-12-19 17:15:14,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2023-12-19 17:15:14,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:14,861 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2023-12-19 17:15:14,871 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-19 17:15:14,872 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 20 treesize of output 17 [2023-12-19 17:15:14,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:14,915 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 26 treesize of output 10 [2023-12-19 17:15:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:14,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:15:15,057 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 38 treesize of output 28 [2023-12-19 17:15:15,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:15,066 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 99 treesize of output 95 [2023-12-19 17:15:15,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:15,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 368 treesize of output 372 [2023-12-19 17:15:15,409 INFO L349 Elim1Store]: treesize reduction 58, result has 25.6 percent of original size [2023-12-19 17:15:15,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 424 treesize of output 427 [2023-12-19 17:15:15,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:15,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 277 treesize of output 297 [2023-12-19 17:15:15,462 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 250 treesize of output 234 [2023-12-19 17:15:15,474 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 234 treesize of output 226 [2023-12-19 17:15:15,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:15,530 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 497 treesize of output 483 [2023-12-19 17:15:15,562 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 328 treesize of output 312 [2023-12-19 17:15:15,576 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 312 treesize of output 304 [2023-12-19 17:15:15,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:15,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 374 treesize of output 374 [2023-12-19 17:15:15,638 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 292 treesize of output 276 [2023-12-19 17:15:15,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:15,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 360 treesize of output 356 [2023-12-19 17:15:17,364 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 11 treesize of output 3 [2023-12-19 17:15:17,374 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 11 treesize of output 3 [2023-12-19 17:15:17,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:17,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 200 treesize of output 208 [2023-12-19 17:15:17,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:17,830 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 101 treesize of output 129 [2023-12-19 17:15:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:18,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461169934] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:15:18,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:15:18,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 25 [2023-12-19 17:15:18,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572513025] [2023-12-19 17:15:18,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:15:18,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-19 17:15:18,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:15:18,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-19 17:15:18,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=502, Unknown=1, NotChecked=0, Total=600 [2023-12-19 17:15:18,210 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 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-19 17:15:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:15:19,096 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2023-12-19 17:15:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 17:15:19,096 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 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 27 [2023-12-19 17:15:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:15:19,097 INFO L225 Difference]: With dead ends: 65 [2023-12-19 17:15:19,097 INFO L226 Difference]: Without dead ends: 60 [2023-12-19 17:15:19,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=284, Invalid=1044, Unknown=4, NotChecked=0, Total=1332 [2023-12-19 17:15:19,097 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 220 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 17:15:19,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 237 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 17:15:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-19 17:15:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2023-12-19 17:15:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 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-19 17:15:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2023-12-19 17:15:19,101 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 27 [2023-12-19 17:15:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:15:19,101 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2023-12-19 17:15:19,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 25 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-19 17:15:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2023-12-19 17:15:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-19 17:15:19,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:15:19,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:15:19,107 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-19 17:15:19,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:19,307 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:15:19,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:15:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash -980998057, now seen corresponding path program 2 times [2023-12-19 17:15:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:15:19,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116435795] [2023-12-19 17:15:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:19,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:15:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:19,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:15:19,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116435795] [2023-12-19 17:15:19,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116435795] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:15:19,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575304957] [2023-12-19 17:15:19,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 17:15:19,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:19,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:15:19,856 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-19 17:15:19,882 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-19 17:15:19,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 17:15:19,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:15:19,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-19 17:15:19,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:15:19,965 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-19 17:15:19,978 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-19 17:15:19,983 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-19 17:15:19,984 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 15 treesize of output 15 [2023-12-19 17:15:19,986 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-19 17:15:20,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-12-19 17:15:20,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2023-12-19 17:15:20,170 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-19 17:15:20,171 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 117 treesize of output 98 [2023-12-19 17:15:20,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-19 17:15:20,177 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 77 treesize of output 23 [2023-12-19 17:15:20,245 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 35 treesize of output 19 [2023-12-19 17:15:20,248 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 7 treesize of output 3 [2023-12-19 17:15:20,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:20,253 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 26 treesize of output 10 [2023-12-19 17:15:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:20,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:15:20,365 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2023-12-19 17:15:20,366 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 1950 treesize of output 1645 [2023-12-19 17:15:20,438 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_516 (Array Int Int))) (= |c_ULTIMATE.start_main_~i~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (forall ((v_ArrVal_514 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.base|))) is different from false [2023-12-19 17:15:20,478 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse3 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|))) (and (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_508 Int)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 .cse1 v_ArrVal_509) .cse2 v_ArrVal_508)) .cse3 v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse3)) (forall ((v_ArrVal_511 (Array Int Int))) (or (not (= v_ArrVal_511 (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) .cse1 (select v_ArrVal_511 .cse1)) .cse2 (select v_ArrVal_511 .cse2)))) (forall ((v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_511) .cse3 v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (select v_ArrVal_511 |c_ULTIMATE.start_main_~i~0#1.offset|)))))))) is different from false [2023-12-19 17:15:20,508 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse1 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~l~0#1.offset|))) (and (forall ((v_ArrVal_511 (Array Int Int))) (or (not (= v_ArrVal_511 (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|) .cse0 (select v_ArrVal_511 .cse0)) .cse1 (select v_ArrVal_511 .cse1)))) (forall ((v_ArrVal_516 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_511) .cse2 v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) (select v_ArrVal_511 |c_ULTIMATE.start_main_~l~0#1.offset|))))) (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_508 Int)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse3 .cse0 v_ArrVal_509) .cse1 v_ArrVal_508)) .cse2 v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse2))))) is different from false [2023-12-19 17:15:20,533 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 60 treesize of output 58 [2023-12-19 17:15:20,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:20,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 65 [2023-12-19 17:15:20,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:20,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 50 [2023-12-19 17:15:20,552 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 25 [2023-12-19 17:15:20,555 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 46 treesize of output 38 [2023-12-19 17:15:20,558 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 25 treesize of output 23 [2023-12-19 17:15:20,565 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 17 treesize of output 13 [2023-12-19 17:15:20,567 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-19 17:15:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-12-19 17:15:20,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575304957] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:15:20,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:15:20,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-12-19 17:15:20,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362213981] [2023-12-19 17:15:20,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:15:20,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-19 17:15:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:15:20,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-19 17:15:20,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=396, Unknown=3, NotChecked=126, Total=600 [2023-12-19 17:15:20,585 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 17:15:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:15:21,076 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2023-12-19 17:15:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 17:15:21,076 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-19 17:15:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:15:21,076 INFO L225 Difference]: With dead ends: 59 [2023-12-19 17:15:21,076 INFO L226 Difference]: Without dead ends: 57 [2023-12-19 17:15:21,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=861, Unknown=3, NotChecked=192, Total=1260 [2023-12-19 17:15:21,077 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 101 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 17:15:21,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 288 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 258 Invalid, 0 Unknown, 171 Unchecked, 0.2s Time] [2023-12-19 17:15:21,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-19 17:15:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2023-12-19 17:15:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 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-19 17:15:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2023-12-19 17:15:21,089 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 30 [2023-12-19 17:15:21,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:15:21,089 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2023-12-19 17:15:21,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 17:15:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2023-12-19 17:15:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-19 17:15:21,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:15:21,090 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:15:21,097 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-19 17:15:21,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:21,292 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:15:21,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:15:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash 369765898, now seen corresponding path program 4 times [2023-12-19 17:15:21,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:15:21,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486425170] [2023-12-19 17:15:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:21,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:15:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:15:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486425170] [2023-12-19 17:15:21,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486425170] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:15:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444930009] [2023-12-19 17:15:21,808 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-19 17:15:21,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:21,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:15:21,818 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-19 17:15:21,860 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-19 17:15:22,146 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-19 17:15:22,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:15:22,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-19 17:15:22,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:15:22,167 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-19 17:15:22,170 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-19 17:15:22,200 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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-19 17:15:22,206 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-19 17:15:22,207 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-19 17:15:22,211 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 20 treesize of output 15 [2023-12-19 17:15:22,215 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 11 treesize of output 7 [2023-12-19 17:15:22,361 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 45 treesize of output 15 [2023-12-19 17:15:22,370 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:15:22,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2023-12-19 17:15:22,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-12-19 17:15:22,379 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 7 treesize of output 3 [2023-12-19 17:15:22,428 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:15:22,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 58 [2023-12-19 17:15:22,436 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 17:15:22,436 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 19 [2023-12-19 17:15:22,438 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 20 treesize of output 13 [2023-12-19 17:15:22,475 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 20 treesize of output 13 [2023-12-19 17:15:22,549 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 26 treesize of output 10 [2023-12-19 17:15:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:15:22,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:15:22,653 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_680 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_675) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_680) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1)))) is different from false [2023-12-19 17:15:22,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:22,755 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 3 case distinctions, treesize of input 140 treesize of output 118 [2023-12-19 17:15:22,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:22,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 241 [2023-12-19 17:15:22,798 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 182 treesize of output 166 [2023-12-19 17:15:22,803 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 86 treesize of output 78 [2023-12-19 17:15:22,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:22,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2023-12-19 17:15:22,995 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-19 17:15:23,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:23,107 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 25 treesize of output 24 [2023-12-19 17:15:23,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:15:23,111 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 21 treesize of output 9 [2023-12-19 17:15:23,113 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 12 treesize of output 10 [2023-12-19 17:15:23,115 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-19 17:15:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-12-19 17:15:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444930009] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:15:23,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:15:23,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 25 [2023-12-19 17:15:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952101695] [2023-12-19 17:15:23,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:15:23,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-19 17:15:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:15:23,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-19 17:15:23,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=528, Unknown=5, NotChecked=46, Total=650 [2023-12-19 17:15:23,121 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 25 states have internal predecessors, (86), 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-19 17:15:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:15:24,979 INFO L93 Difference]: Finished difference Result 122 states and 160 transitions. [2023-12-19 17:15:24,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-19 17:15:24,979 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 25 states have internal predecessors, (86), 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-19 17:15:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:15:24,979 INFO L225 Difference]: With dead ends: 122 [2023-12-19 17:15:24,979 INFO L226 Difference]: Without dead ends: 79 [2023-12-19 17:15:24,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=298, Invalid=1670, Unknown=16, NotChecked=86, Total=2070 [2023-12-19 17:15:24,981 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 215 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 46 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-19 17:15:24,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 362 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 374 Invalid, 4 Unknown, 90 Unchecked, 0.9s Time] [2023-12-19 17:15:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-19 17:15:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2023-12-19 17:15:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 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-19 17:15:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2023-12-19 17:15:24,985 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 31 [2023-12-19 17:15:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:15:24,986 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2023-12-19 17:15:24,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 25 states have internal predecessors, (86), 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-19 17:15:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2023-12-19 17:15:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-19 17:15:24,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:15:24,987 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:15:24,993 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-19 17:15:25,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:25,188 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:15:25,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:15:25,188 INFO L85 PathProgramCache]: Analyzing trace with hash -752007675, now seen corresponding path program 3 times [2023-12-19 17:15:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:15:25,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816317320] [2023-12-19 17:15:25,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:15:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:15:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:15:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 17:15:25,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:15:25,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816317320] [2023-12-19 17:15:25,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816317320] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:15:25,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759839908] [2023-12-19 17:15:25,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 17:15:25,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:15:25,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:15:25,554 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-19 17:15:25,578 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-19 17:15:25,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-19 17:15:25,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:15:25,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-19 17:15:25,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:15:25,706 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-19 17:15:25,716 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-19 17:15:25,716 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 15 treesize of output 15 [2023-12-19 17:15:25,719 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-19 17:15:25,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2023-12-19 17:15:25,796 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-19 17:15:25,796 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 71 treesize of output 64 [2023-12-19 17:15:25,798 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 47 treesize of output 32 [2023-12-19 17:15:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 17:15:25,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:15:26,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:26,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 265 treesize of output 325 [2023-12-19 17:15:26,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:26,258 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 264 treesize of output 302 [2023-12-19 17:15:26,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:15:26,282 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 195 treesize of output 200 [2023-12-19 17:15:34,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-19 17:15:34,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-19 17:15:34,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-12-19 17:15:34,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-12-19 17:15:35,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-19 17:15:35,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-12-19 17:15:35,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-19 17:15:42,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-12-19 17:15:42,757 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-19 17:15:42,806 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-19 17:15:42,812 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-19 17:15:43,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-12-19 17:15:43,054 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-19 17:15:43,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-12-19 17:15:44,605 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-19 17:15:45,490 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-19 17:15:45,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-19 17:15:46,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-12-19 17:16:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 17:16:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759839908] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:16:02,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:16:02,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2023-12-19 17:16:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568349027] [2023-12-19 17:16:02,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:16:02,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-19 17:16:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:16:02,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-19 17:16:02,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=341, Unknown=16, NotChecked=0, Total=420 [2023-12-19 17:16:02,718 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 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-19 17:16:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:16:03,197 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2023-12-19 17:16:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 17:16:03,197 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 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 37 [2023-12-19 17:16:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:16:03,197 INFO L225 Difference]: With dead ends: 83 [2023-12-19 17:16:03,197 INFO L226 Difference]: Without dead ends: 70 [2023-12-19 17:16:03,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=204, Invalid=893, Unknown=25, NotChecked=0, Total=1122 [2023-12-19 17:16:03,198 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 154 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 17:16:03,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 300 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 17:16:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-19 17:16:03,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2023-12-19 17:16:03,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 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-19 17:16:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2023-12-19 17:16:03,211 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 37 [2023-12-19 17:16:03,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:16:03,211 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2023-12-19 17:16:03,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 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-19 17:16:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2023-12-19 17:16:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-19 17:16:03,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:16:03,216 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:16:03,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-19 17:16:03,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:16:03,422 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:16:03,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:16:03,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1181486556, now seen corresponding path program 1 times [2023-12-19 17:16:03,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:16:03,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113206686] [2023-12-19 17:16:03,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:16:03,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:16:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:16:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:16:04,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:16:04,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113206686] [2023-12-19 17:16:04,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113206686] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:16:04,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464974827] [2023-12-19 17:16:04,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:16:04,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:16:04,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:16:04,213 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-19 17:16:04,229 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-19 17:16:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:16:04,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-19 17:16:04,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:16:04,372 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-19 17:16:04,385 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-19 17:16:04,392 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-19 17:16:04,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-12-19 17:16:04,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:16:04,407 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 25 [2023-12-19 17:16:04,409 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 12 treesize of output 1 [2023-12-19 17:16:04,419 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2023-12-19 17:16:04,419 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 32 treesize of output 34 [2023-12-19 17:16:04,427 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-19 17:16:04,494 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 45 treesize of output 15 [2023-12-19 17:16:04,518 INFO L349 Elim1Store]: treesize reduction 107, result has 9.3 percent of original size [2023-12-19 17:16:04,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 30 [2023-12-19 17:16:04,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2023-12-19 17:16:04,527 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 24 treesize of output 16 [2023-12-19 17:16:04,613 INFO L349 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2023-12-19 17:16:04,613 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 94 treesize of output 71 [2023-12-19 17:16:04,618 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-19 17:16:04,618 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2023-12-19 17:16:04,621 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 20 treesize of output 13 [2023-12-19 17:16:04,642 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 20 treesize of output 13 [2023-12-19 17:16:04,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:04,654 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 26 treesize of output 10 [2023-12-19 17:16:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-19 17:16:04,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:16:04,720 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1035 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1035) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_1039) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1)))) is different from false [2023-12-19 17:16:04,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:04,780 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 3 case distinctions, treesize of input 140 treesize of output 118 [2023-12-19 17:16:04,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:04,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 217 treesize of output 241 [2023-12-19 17:16:04,805 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 182 treesize of output 166 [2023-12-19 17:16:04,836 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 86 treesize of output 78 [2023-12-19 17:16:05,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:05,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2023-12-19 17:16:05,005 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-19 17:16:05,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:05,054 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 25 treesize of output 24 [2023-12-19 17:16:05,055 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:16:05,056 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 21 treesize of output 9 [2023-12-19 17:16:05,057 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 11 treesize of output 9 [2023-12-19 17:16:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 17 not checked. [2023-12-19 17:16:05,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464974827] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:16:05,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:16:05,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2023-12-19 17:16:05,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692349325] [2023-12-19 17:16:05,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:16:05,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-19 17:16:05,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:16:05,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-19 17:16:05,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=387, Unknown=5, NotChecked=40, Total=506 [2023-12-19 17:16:05,086 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 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-19 17:16:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:16:05,624 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2023-12-19 17:16:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 17:16:05,624 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 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) Word has length 38 [2023-12-19 17:16:05,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:16:05,625 INFO L225 Difference]: With dead ends: 85 [2023-12-19 17:16:05,625 INFO L226 Difference]: Without dead ends: 80 [2023-12-19 17:16:05,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=922, Unknown=11, NotChecked=66, Total=1260 [2023-12-19 17:16:05,626 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 265 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 17:16:05,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 223 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 160 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2023-12-19 17:16:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-19 17:16:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 57. [2023-12-19 17:16:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 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-19 17:16:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2023-12-19 17:16:05,629 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 38 [2023-12-19 17:16:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:16:05,630 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2023-12-19 17:16:05,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 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-19 17:16:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2023-12-19 17:16:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-19 17:16:05,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:16:05,630 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:16:05,637 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-19 17:16:05,835 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,SelfDestructingSolverStorable11 [2023-12-19 17:16:05,835 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:16:05,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:16:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1940531238, now seen corresponding path program 4 times [2023-12-19 17:16:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:16:05,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066668674] [2023-12-19 17:16:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:16:05,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:16:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:16:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:16:06,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:16:06,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066668674] [2023-12-19 17:16:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066668674] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:16:06,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359351216] [2023-12-19 17:16:06,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-19 17:16:06,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:16:06,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:16:06,622 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:16:06,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-19 17:16:06,860 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-19 17:16:06,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:16:06,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-19 17:16:06,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:16:06,868 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-19 17:16:06,884 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-19 17:16:06,897 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-12-19 17:16:06,898 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 21 treesize of output 29 [2023-12-19 17:16:06,924 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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-19 17:16:06,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:16:06,928 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 38 treesize of output 27 [2023-12-19 17:16:06,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:16:06,935 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-12-19 17:16:06,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 28 treesize of output 22 [2023-12-19 17:16:06,940 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-19 17:16:07,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2023-12-19 17:16:07,055 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:16:07,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2023-12-19 17:16:07,159 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:16:07,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 107 [2023-12-19 17:16:07,163 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 77 treesize of output 23 [2023-12-19 17:16:07,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:16:07,168 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-19 17:16:07,247 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-19 17:16:07,247 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 120 treesize of output 83 [2023-12-19 17:16:07,251 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 44 treesize of output 17 [2023-12-19 17:16:07,255 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 32 treesize of output 11 [2023-12-19 17:16:07,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 17:16:07,345 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 30 [2023-12-19 17:16:07,348 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 7 treesize of output 3 [2023-12-19 17:16:07,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:07,352 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 26 treesize of output 10 [2023-12-19 17:16:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:16:07,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:16:07,416 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1236 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1237) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1236) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (< (select .cse0 (+ .cse1 8)) (+ (select .cse0 (+ .cse1 4)) 1)))) is different from false [2023-12-19 17:16:07,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:07,482 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 3 case distinctions, treesize of input 160 treesize of output 138 [2023-12-19 17:16:07,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:07,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 327 [2023-12-19 17:16:07,530 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 73 treesize of output 37 [2023-12-19 17:16:07,802 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse6 (+ .cse8 8)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse7 (+ .cse8 4)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (forall ((v_ArrVal_1225 (Array Int Int))) (or (not (= v_ArrVal_1225 (store (store .cse0 .cse1 (select v_ArrVal_1225 .cse1)) .cse2 (select v_ArrVal_1225 .cse2)))) (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1228 Int) (v_ArrVal_1229 Int)) (let ((.cse4 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1225))) (let ((.cse5 (select .cse3 .cse4))) (store (store .cse3 .cse4 (store (store .cse5 .cse6 v_ArrVal_1229) .cse7 v_ArrVal_1228)) (select .cse5 .cse8) v_ArrVal_1236))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse4))))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1228 Int) (v_ArrVal_1229 Int)) (not (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1225)) (.cse10 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse11 (select .cse9 .cse10))) (let ((.cse12 (select .cse11 .cse8))) (= (select (select (store (store .cse9 .cse10 (store (store .cse11 .cse6 v_ArrVal_1229) .cse7 v_ArrVal_1228)) .cse12 v_ArrVal_1236) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse12)))))) (not (= v_ArrVal_1225 (store (store .cse0 .cse1 (select v_ArrVal_1225 .cse1)) .cse2 (select v_ArrVal_1225 .cse2)))))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1224 Int) (v_ArrVal_1230 (Array Int Int))) (= (select (select (let ((.cse14 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse13 .cse1 v_ArrVal_1222) .cse2 v_ArrVal_1224)) .cse14 v_ArrVal_1230) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1225) .cse14) .cse8) v_ArrVal_1239)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse8)) (not (= v_ArrVal_1225 (store (store .cse0 .cse1 (select v_ArrVal_1225 .cse1)) .cse2 (select v_ArrVal_1225 .cse2)))))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (not (= v_ArrVal_1225 (store (store .cse0 .cse1 (select v_ArrVal_1225 .cse1)) .cse2 (select v_ArrVal_1225 .cse2)))) (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1224 Int) (v_ArrVal_1230 (Array Int Int))) (let ((.cse15 (select (select (let ((.cse16 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse13 .cse1 v_ArrVal_1222) .cse2 v_ArrVal_1224)) .cse16 v_ArrVal_1230) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1225) .cse16) .cse8) v_ArrVal_1239)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse15 .cse7) (= .cse15 .cse8)))))))))) is different from false [2023-12-19 17:16:07,934 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse12 (+ 8 .cse1)) (.cse2 (+ .cse1 4))) (and (forall ((v_ArrVal_1225 (Array Int Int))) (or (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1224 Int) (v_ArrVal_1230 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse6 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1222) .cse5 v_ArrVal_1224)) .cse6 v_ArrVal_1230) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1225) .cse6) .cse1) v_ArrVal_1239)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse0 .cse1) (= .cse0 .cse2)))) (not (= (store (store .cse7 .cse4 (select v_ArrVal_1225 .cse4)) .cse5 (select v_ArrVal_1225 .cse5)) v_ArrVal_1225)))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1222 Int) (v_ArrVal_1224 Int) (v_ArrVal_1230 (Array Int Int))) (= (select (select (let ((.cse8 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~l~0#1.offset|))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1222) .cse5 v_ArrVal_1224)) .cse8 v_ArrVal_1230) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1225) .cse8) .cse1) v_ArrVal_1239)) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse1)) (not (= (store (store .cse7 .cse4 (select v_ArrVal_1225 .cse4)) .cse5 (select v_ArrVal_1225 .cse5)) v_ArrVal_1225)))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1228 Int) (v_ArrVal_1229 Int)) (not (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1225)) (.cse10 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse11 (select .cse9 .cse10))) (let ((.cse13 (select .cse11 .cse1))) (= (select (select (store (store .cse9 .cse10 (store (store .cse11 .cse12 v_ArrVal_1229) .cse2 v_ArrVal_1228)) .cse13 v_ArrVal_1236) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse13)))))) (not (= (store (store .cse7 .cse4 (select v_ArrVal_1225 .cse4)) .cse5 (select v_ArrVal_1225 .cse5)) v_ArrVal_1225)))) (forall ((v_ArrVal_1225 (Array Int Int))) (or (not (= (store (store .cse7 .cse4 (select v_ArrVal_1225 .cse4)) .cse5 (select v_ArrVal_1225 .cse5)) v_ArrVal_1225)) (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1228 Int) (v_ArrVal_1229 Int)) (let ((.cse15 (select v_ArrVal_1225 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= (select (select (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1225))) (let ((.cse16 (select .cse14 .cse15))) (store (store .cse14 .cse15 (store (store .cse16 .cse12 v_ArrVal_1229) .cse2 v_ArrVal_1228)) (select .cse16 .cse1) v_ArrVal_1236))) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse15))))))))) is different from false [2023-12-19 17:16:08,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:08,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 289 treesize of output 305 [2023-12-19 17:16:08,067 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 647 treesize of output 639 [2023-12-19 17:16:08,072 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-19 17:16:08,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:08,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 373 treesize of output 524 [2023-12-19 17:16:08,147 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 321 treesize of output 317 [2023-12-19 17:16:08,158 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 317 treesize of output 315 [2023-12-19 17:16:08,169 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 315 treesize of output 311 [2023-12-19 17:16:08,179 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 311 treesize of output 303 [2023-12-19 17:16:08,257 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 17 treesize of output 13 [2023-12-19 17:16:08,268 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 17 treesize of output 13 [2023-12-19 17:16:08,306 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 17 treesize of output 13 [2023-12-19 17:16:08,316 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 17 treesize of output 13 [2023-12-19 17:16:08,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2023-12-19 17:16:08,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2023-12-19 17:16:08,368 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 17 treesize of output 13 [2023-12-19 17:16:08,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:16:08,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:16:08,403 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 17 treesize of output 13 [2023-12-19 17:16:08,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:16:08,443 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-19 17:16:08,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:08,573 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 136 treesize of output 105 [2023-12-19 17:16:08,589 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-12-19 17:16:08,589 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 193 treesize of output 161 [2023-12-19 17:16:08,594 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 88 treesize of output 84 [2023-12-19 17:16:08,596 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 95 treesize of output 83 [2023-12-19 17:16:08,599 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 85 treesize of output 79 [2023-12-19 17:16:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 22 not checked. [2023-12-19 17:16:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359351216] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:16:08,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:16:08,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2023-12-19 17:16:08,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016272190] [2023-12-19 17:16:08,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:16:08,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-19 17:16:08,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:16:08,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-19 17:16:08,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=656, Unknown=6, NotChecked=162, Total=930 [2023-12-19 17:16:08,683 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 31 states have internal predecessors, (98), 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-19 17:16:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:16:25,989 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2023-12-19 17:16:25,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 17:16:25,989 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 31 states have internal predecessors, (98), 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 38 [2023-12-19 17:16:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:16:25,990 INFO L225 Difference]: With dead ends: 73 [2023-12-19 17:16:25,990 INFO L226 Difference]: Without dead ends: 71 [2023-12-19 17:16:25,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=303, Invalid=1337, Unknown=12, NotChecked=240, Total=1892 [2023-12-19 17:16:25,990 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 284 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 17:16:25,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 280 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 269 Invalid, 0 Unknown, 221 Unchecked, 0.5s Time] [2023-12-19 17:16:25,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-19 17:16:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2023-12-19 17:16:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 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-19 17:16:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2023-12-19 17:16:25,995 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 38 [2023-12-19 17:16:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:16:25,995 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2023-12-19 17:16:25,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.161290322580645) internal successors, (98), 31 states have internal predecessors, (98), 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-19 17:16:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2023-12-19 17:16:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-19 17:16:25,996 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:16:25,996 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:16:26,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-19 17:16:26,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-19 17:16:26,196 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:16:26,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:16:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash 742860827, now seen corresponding path program 5 times [2023-12-19 17:16:26,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:16:26,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568360879] [2023-12-19 17:16:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:16:26,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:16:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:16:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:16:27,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:16:27,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568360879] [2023-12-19 17:16:27,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568360879] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:16:27,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374403203] [2023-12-19 17:16:27,016 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-19 17:16:27,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:16:27,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:16:27,017 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:16:27,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-19 17:16:30,358 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-12-19 17:16:30,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:16:30,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 89 conjunts are in the unsatisfiable core [2023-12-19 17:16:30,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:16:30,387 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-19 17:16:30,391 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-19 17:16:30,396 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-19 17:16:30,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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-19 17:16:30,467 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2023-12-19 17:16:30,467 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 21 treesize of output 31 [2023-12-19 17:16:30,469 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 8 treesize of output 7 [2023-12-19 17:16:30,488 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-19 17:16:30,488 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 20 treesize of output 23 [2023-12-19 17:16:30,511 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-12-19 17:16:30,511 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 21 treesize of output 29 [2023-12-19 17:16:30,618 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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-19 17:16:30,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:16:30,634 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2023-12-19 17:16:30,634 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 68 treesize of output 51 [2023-12-19 17:16:30,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:16:30,652 INFO L349 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2023-12-19 17:16:30,652 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 36 treesize of output 53 [2023-12-19 17:16:30,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-19 17:16:30,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:16:30,687 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-12-19 17:16:30,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 28 treesize of output 22 [2023-12-19 17:16:30,886 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-19 17:16:30,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 53 [2023-12-19 17:16:30,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:16:30,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 43 [2023-12-19 17:16:31,056 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-19 17:16:31,056 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 115 [2023-12-19 17:16:31,064 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-19 17:16:31,065 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 100 [2023-12-19 17:16:31,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:16:31,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2023-12-19 17:16:31,202 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-19 17:16:31,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 92 [2023-12-19 17:16:31,221 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2023-12-19 17:16:31,222 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 46 [2023-12-19 17:16:31,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2023-12-19 17:16:31,228 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-19 17:16:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:16:31,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:16:31,302 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse4 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|))) (and (forall ((v_ArrVal_1464 Int) (v_ArrVal_1468 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 .cse1 v_ArrVal_1464) .cse2 v_ArrVal_1468)) (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|)) .cse4) 0)) (forall ((v_ArrVal_1465 (Array Int Int))) (or (not (= (store (store .cse3 .cse1 (select v_ArrVal_1465 .cse1)) .cse2 (select v_ArrVal_1465 .cse2)) v_ArrVal_1465)) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1465) (select v_ArrVal_1465 |c_ULTIMATE.start_main_~i~0#1.offset|)) .cse4) 0)))))) is different from false [2023-12-19 17:16:31,402 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse6 (+ .cse8 8)) (.cse7 (+ .cse8 4)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (forall ((v_ArrVal_1461 (Array Int Int))) (or (not (= v_ArrVal_1461 (store (store .cse0 .cse1 (select v_ArrVal_1461 .cse1)) .cse2 (select v_ArrVal_1461 .cse2)))) (forall ((v_ArrVal_1464 Int) (v_ArrVal_1457 Int) (v_ArrVal_1468 Int) (v_ArrVal_1459 Int)) (= (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse9 .cse1 v_ArrVal_1457) .cse2 v_ArrVal_1459))) (.cse4 (select v_ArrVal_1461 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (select (select (store .cse3 .cse4 (store (store .cse5 .cse6 v_ArrVal_1464) .cse7 v_ArrVal_1468)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1461) .cse4) .cse8)) (select .cse5 .cse8)))) 0)))) (forall ((v_ArrVal_1461 (Array Int Int))) (or (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1457 Int) (v_ArrVal_1459 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1461)) (.cse11 (select v_ArrVal_1461 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= v_ArrVal_1465 (store (store (select .cse10 .cse11) .cse6 (select v_ArrVal_1465 .cse6)) .cse7 (select v_ArrVal_1465 .cse7)))) (= (select (select (store .cse10 .cse11 v_ArrVal_1465) (select v_ArrVal_1465 .cse8)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse9 .cse1 v_ArrVal_1457) .cse2 v_ArrVal_1459)) .cse11) .cse8)) 0)))) (not (= v_ArrVal_1461 (store (store .cse0 .cse1 (select v_ArrVal_1461 .cse1)) .cse2 (select v_ArrVal_1461 .cse2)))))))))) is different from false [2023-12-19 17:16:31,506 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse6 (+ 8 .cse2)) (.cse7 (+ .cse2 4)) (.cse4 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (and (forall ((v_ArrVal_1461 (Array Int Int))) (or (forall ((v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1457 Int) (v_ArrVal_1459 Int)) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1461)) (.cse1 (select v_ArrVal_1461 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select (store .cse0 .cse1 v_ArrVal_1465) (select v_ArrVal_1465 .cse2)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1457) .cse5 v_ArrVal_1459)) .cse1) .cse2)) 0) (not (= (store (store (select .cse0 .cse1) .cse6 (select v_ArrVal_1465 .cse6)) .cse7 (select v_ArrVal_1465 .cse7)) v_ArrVal_1465))))) (not (= v_ArrVal_1461 (store (store .cse8 .cse4 (select v_ArrVal_1461 .cse4)) .cse5 (select v_ArrVal_1461 .cse5)))))) (forall ((v_ArrVal_1461 (Array Int Int))) (or (not (= v_ArrVal_1461 (store (store .cse8 .cse4 (select v_ArrVal_1461 .cse4)) .cse5 (select v_ArrVal_1461 .cse5)))) (forall ((v_ArrVal_1464 Int) (v_ArrVal_1457 Int) (v_ArrVal_1468 Int) (v_ArrVal_1459 Int)) (= (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse3 .cse4 v_ArrVal_1457) .cse5 v_ArrVal_1459))) (.cse10 (select v_ArrVal_1461 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse11 (select .cse9 .cse10))) (select (select (store .cse9 .cse10 (store (store .cse11 .cse6 v_ArrVal_1464) .cse7 v_ArrVal_1468)) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1461) .cse10) .cse2)) (select .cse11 .cse2)))) 0)))))))) is different from false [2023-12-19 17:16:31,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:31,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 178 treesize of output 198 [2023-12-19 17:16:31,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:31,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 142 treesize of output 180 [2023-12-19 17:16:31,695 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 17 treesize of output 13 [2023-12-19 17:16:31,712 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 17 treesize of output 13 [2023-12-19 17:16:31,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:16:31,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:16:32,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:32,097 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 180 treesize of output 178 [2023-12-19 17:16:32,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:32,105 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 171 treesize of output 166 [2023-12-19 17:16:32,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:32,514 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 109 treesize of output 84 [2023-12-19 17:16:32,516 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:16:32,525 INFO L349 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2023-12-19 17:16:32,526 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 272 treesize of output 238 [2023-12-19 17:16:32,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:32,532 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 61 treesize of output 47 [2023-12-19 17:16:32,534 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:16:32,535 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 23 treesize of output 17 [2023-12-19 17:16:32,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:32,547 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 94 treesize of output 80 [2023-12-19 17:16:32,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:16:32,577 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 43 treesize of output 42 [2023-12-19 17:16:32,580 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:16:32,582 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 30 treesize of output 24 [2023-12-19 17:16:32,586 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-19 17:16:32,595 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-12-19 17:16:32,596 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 182 treesize of output 168 [2023-12-19 17:16:32,610 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-19 17:16:32,611 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 32 treesize of output 26 [2023-12-19 17:16:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2023-12-19 17:16:32,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374403203] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 17:16:32,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 17:16:32,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2023-12-19 17:16:32,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942452667] [2023-12-19 17:16:32,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 17:16:32,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-19 17:16:32,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 17:16:32,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-19 17:16:32,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=267, Unknown=3, NotChecked=102, Total=420 [2023-12-19 17:16:32,635 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 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-19 17:16:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 17:16:57,760 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2023-12-19 17:16:57,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 17:16:57,761 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 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 39 [2023-12-19 17:16:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 17:16:57,761 INFO L225 Difference]: With dead ends: 114 [2023-12-19 17:16:57,761 INFO L226 Difference]: Without dead ends: 93 [2023-12-19 17:16:57,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=71, Invalid=398, Unknown=5, NotChecked=126, Total=600 [2023-12-19 17:16:57,762 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 97 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 17:16:57,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 395 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 267 Invalid, 0 Unknown, 176 Unchecked, 0.6s Time] [2023-12-19 17:16:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-19 17:16:57,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-12-19 17:16:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 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-19 17:16:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 115 transitions. [2023-12-19 17:16:57,769 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 115 transitions. Word has length 39 [2023-12-19 17:16:57,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 17:16:57,769 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 115 transitions. [2023-12-19 17:16:57,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 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-19 17:16:57,769 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 115 transitions. [2023-12-19 17:16:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-19 17:16:57,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 17:16:57,770 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 17:16:57,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-19 17:16:57,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-19 17:16:57,978 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 17:16:57,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 17:16:57,978 INFO L85 PathProgramCache]: Analyzing trace with hash 110203856, now seen corresponding path program 5 times [2023-12-19 17:16:57,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 17:16:57,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499002243] [2023-12-19 17:16:57,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 17:16:57,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 17:16:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 17:16:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:16:59,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 17:16:59,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499002243] [2023-12-19 17:16:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499002243] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 17:16:59,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717795644] [2023-12-19 17:16:59,131 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-19 17:16:59,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 17:16:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 17:16:59,132 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 17:16:59,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-19 17:17:02,350 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-12-19 17:17:02,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 17:17:02,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 87 conjunts are in the unsatisfiable core [2023-12-19 17:17:02,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 17:17:02,365 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-19 17:17:02,382 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-19 17:17:02,402 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-12-19 17:17:02,402 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 21 treesize of output 29 [2023-12-19 17:17:02,412 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-19 17:17:02,485 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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-12-19 17:17:02,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:17:02,492 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 38 treesize of output 27 [2023-12-19 17:17:02,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:17:02,503 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2023-12-19 17:17:02,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 28 treesize of output 22 [2023-12-19 17:17:02,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:17:02,511 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 21 treesize of output 23 [2023-12-19 17:17:02,518 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 8 treesize of output 7 [2023-12-19 17:17:02,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:17:02,696 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 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 17:17:02,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:17:02,704 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 0 case distinctions, treesize of input 34 treesize of output 25 [2023-12-19 17:17:02,714 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:17:02,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 33 [2023-12-19 17:17:02,820 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:17:02,821 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 1 case distinctions, treesize of input 151 treesize of output 96 [2023-12-19 17:17:02,827 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-19 17:17:02,827 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 1 case distinctions, treesize of input 124 treesize of output 81 [2023-12-19 17:17:02,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:17:02,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2023-12-19 17:17:03,035 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-19 17:17:03,035 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 196 treesize of output 125 [2023-12-19 17:17:03,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 17:17:03,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2023-12-19 17:17:03,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 31 [2023-12-19 17:17:03,338 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-19 17:17:03,339 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 37 [2023-12-19 17:17:03,343 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 15 treesize of output 7 [2023-12-19 17:17:03,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:17:03,349 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 26 treesize of output 10 [2023-12-19 17:17:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 17:17:03,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 17:17:03,629 INFO L349 Elim1Store]: treesize reduction 54, result has 50.5 percent of original size [2023-12-19 17:17:03,629 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 4134 treesize of output 3409 [2023-12-19 17:17:03,747 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677)) (.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ (select (select .cse0 .cse1) .cse2) 4) |c_ULTIMATE.start_main_~i~0#1.offset|) (= |c_ULTIMATE.start_main_~i~0#1.base| (select (select .cse3 .cse1) .cse2)))))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677))) (select (select .cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse6 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (or (= .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) (= .cse5 .cse4)))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse8 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (or (= .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|) (= (+ .cse7 4) |c_ULTIMATE.start_main_~i~0#1.offset|)))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677)) (.cse12 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse11 (select (select .cse9 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse5 (select (select .cse9 .cse10) .cse11)) (= |c_ULTIMATE.start_main_~i~0#1.base| (select (select .cse12 .cse10) .cse11)))))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (= (let ((.cse13 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677))) (select (select .cse13 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse13 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) |c_ULTIMATE.start_main_~i~0#1.offset|)) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 (Array Int Int))) (= |c_ULTIMATE.start_main_~i~0#1.base| (select (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1672))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) is different from false [2023-12-19 17:17:04,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_DerPreprocessor_71 Int) (v_prenex_4513 (Array Int Int)) (v_ArrVal_1668 Int) (v_prenex_4514 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_prenex_4513)) (.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_prenex_4514))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse0 .cse1) .cse2) .cse3) (= (+ (select (select .cse4 .cse1) .cse2) 4) (select v_ArrVal_1669 |c_ULTIMATE.start_main_~i~0#1.offset|)))))) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7)))))) (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_DerPreprocessor_71 Int) (v_prenex_4522 (Array Int Int)) (v_prenex_4521 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse10 (let ((.cse11 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_prenex_4521))) (select (select .cse11 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_prenex_4522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse11 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (.cse9 (select v_ArrVal_1669 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (= (+ 4 .cse9) .cse10) (= .cse10 .cse9)))) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7)))))) (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_prenex_4519 (Array Int Int)) (v_prenex_4520 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int)) (let ((.cse15 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_prenex_4519)) (.cse12 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_prenex_4520))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse12 .cse13) .cse14) .cse3) (= (+ 4 (select v_ArrVal_1669 |c_ULTIMATE.start_main_~i~0#1.offset|)) (select (select .cse15 .cse13) .cse14)))))) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7)))))) (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_ArrVal_1677 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1672 (Array Int Int)) (v_ArrVal_1668 Int)) (= (select (let ((.cse16 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_ArrVal_1672))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_ArrVal_1677) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse3)) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7)))))) (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int) (v_prenex_4516 (Array Int Int)) (v_prenex_4515 (Array Int Int))) (= (let ((.cse17 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_prenex_4515))) (select (select .cse17 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_prenex_4516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse17 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select v_ArrVal_1669 |c_ULTIMATE.start_main_~i~0#1.offset|))) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7)))))) (forall ((v_ArrVal_1669 (Array Int Int))) (or (forall ((v_prenex_4518 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_prenex_4517 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse19 (let ((.cse20 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1669) .cse3 v_prenex_4517))) (select (select .cse20 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse5 .cse6 v_DerPreprocessor_71) .cse7 v_ArrVal_1668)) .cse3 v_prenex_4518) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse20 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (.cse18 (select v_ArrVal_1669 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (= .cse18 .cse19) (= (+ 4 .cse19) .cse18)))) (not (= v_ArrVal_1669 (store (store .cse8 .cse6 (select v_ArrVal_1669 .cse6)) .cse7 (select v_ArrVal_1669 .cse7))))))))) is different from false [2023-12-19 17:17:08,800 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse12 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse10 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse11 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse4 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse2 (+ .cse4 8)) (.cse3 (+ .cse4 4)) (.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse1 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse0 .cse1) .cse2 (select v_ArrVal_1669 .cse2)) .cse3 (select v_ArrVal_1669 .cse3)) v_ArrVal_1669)) (forall ((v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int) (v_prenex_4516 (Array Int Int)) (v_prenex_4515 (Array Int Int))) (= (select v_ArrVal_1669 .cse4) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse7 (select .cse6 .cse1))) (let ((.cse8 (select .cse7 .cse4))) (let ((.cse5 (store (store .cse0 .cse1 v_ArrVal_1669) .cse8 v_prenex_4515))) (select (select .cse5 (select (select (store (store .cse6 .cse1 (store (store .cse7 .cse2 v_DerPreprocessor_71) .cse3 v_ArrVal_1668)) .cse8 v_prenex_4516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse5 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))))))) (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse20 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse15 (+ .cse20 8)) (.cse16 (+ .cse20 4)) (.cse13 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse14 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse13 .cse14) .cse15 (select v_ArrVal_1669 .cse15)) .cse16 (select v_ArrVal_1669 .cse16)) v_ArrVal_1669)) (forall ((v_DerPreprocessor_71 Int) (v_prenex_4513 (Array Int Int)) (v_ArrVal_1668 Int) (v_prenex_4514 (Array Int Int))) (let ((.cse23 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse24 (select .cse23 .cse14))) (let ((.cse21 (select .cse24 .cse20))) (let ((.cse17 (store (store .cse13 .cse14 v_ArrVal_1669) .cse21 v_prenex_4513)) (.cse22 (store (store .cse23 .cse14 (store (store .cse24 .cse15 v_DerPreprocessor_71) .cse16 v_ArrVal_1668)) .cse21 v_prenex_4514))) (let ((.cse18 (select (select .cse22 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse19 (select (select .cse17 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (+ 4 (select (select .cse17 .cse18) .cse19)) (select v_ArrVal_1669 .cse20)) (= .cse21 (select (select .cse22 .cse18) .cse19))))))))))))))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse32 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse27 (+ .cse32 8)) (.cse28 (+ .cse32 4)) (.cse25 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse26 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse25 .cse26) .cse27 (select v_ArrVal_1669 .cse27)) .cse28 (select v_ArrVal_1669 .cse28)) v_ArrVal_1669)) (forall ((v_prenex_4519 (Array Int Int)) (v_prenex_4520 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int)) (let ((.cse35 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse36 (select .cse35 .cse26))) (let ((.cse34 (select .cse36 .cse32))) (let ((.cse29 (store (store .cse25 .cse26 v_ArrVal_1669) .cse34 v_prenex_4519)) (.cse33 (store (store .cse35 .cse26 (store (store .cse36 .cse27 v_DerPreprocessor_71) .cse28 v_ArrVal_1668)) .cse34 v_prenex_4520))) (let ((.cse30 (select (select .cse33 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse31 (select (select .cse29 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse29 .cse30) .cse31) (+ (select v_ArrVal_1669 .cse32) 4)) (= (select (select .cse33 .cse30) .cse31) .cse34)))))))))))) (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse45 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse39 (+ .cse45 8)) (.cse40 (+ .cse45 4)) (.cse37 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse38 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse37 .cse38) .cse39 (select v_ArrVal_1669 .cse39)) .cse40 (select v_ArrVal_1669 .cse40)) v_ArrVal_1669)) (forall ((v_ArrVal_1677 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1672 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse43 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse44 (select .cse43 .cse38))) (let ((.cse41 (select .cse44 .cse45))) (= .cse41 (select (let ((.cse42 (store (store .cse43 .cse38 (store (store .cse44 .cse39 v_DerPreprocessor_71) .cse40 v_ArrVal_1668)) .cse41 v_ArrVal_1672))) (select .cse42 (select (select .cse42 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (store .cse37 .cse38 v_ArrVal_1669) .cse41 v_ArrVal_1677) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))))))) (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse56 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse48 (+ .cse56 8)) (.cse49 (+ .cse56 4)) (.cse46 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse47 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse46 .cse47) .cse48 (select v_ArrVal_1669 .cse48)) .cse49 (select v_ArrVal_1669 .cse49)) v_ArrVal_1669)) (forall ((v_DerPreprocessor_71 Int) (v_prenex_4522 (Array Int Int)) (v_prenex_4521 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse51 (select v_ArrVal_1669 .cse56)) (.cse50 (let ((.cse53 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse54 (select .cse53 .cse47))) (let ((.cse55 (select .cse54 .cse56))) (let ((.cse52 (store (store .cse46 .cse47 v_ArrVal_1669) .cse55 v_prenex_4521))) (select (select .cse52 (select (select (store (store .cse53 .cse47 (store (store .cse54 .cse48 v_DerPreprocessor_71) .cse49 v_ArrVal_1668)) .cse55 v_prenex_4522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse52 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (or (= .cse50 (+ .cse51 4)) (= .cse51 .cse50)))))))) (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse63 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~i~0#1.offset|))) (let ((.cse59 (+ .cse63 8)) (.cse60 (+ .cse63 4)) (.cse57 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1665)) (.cse58 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= (store (store (select .cse57 .cse58) .cse59 (select v_ArrVal_1669 .cse59)) .cse60 (select v_ArrVal_1669 .cse60)) v_ArrVal_1669)) (forall ((v_prenex_4518 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_prenex_4517 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse61 (let ((.cse65 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1664))) (let ((.cse66 (select .cse65 .cse58))) (let ((.cse67 (select .cse66 .cse63))) (let ((.cse64 (store (store .cse57 .cse58 v_ArrVal_1669) .cse67 v_prenex_4517))) (select (select .cse64 (select (select (store (store .cse65 .cse58 (store (store .cse66 .cse59 v_DerPreprocessor_71) .cse60 v_ArrVal_1668)) .cse67 v_prenex_4518) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse64 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) (.cse62 (select v_ArrVal_1669 .cse63))) (or (= .cse61 .cse62) (= (+ .cse61 4) .cse62)))))))) (not (= (store (store .cse9 .cse10 (select v_ArrVal_1665 .cse10)) .cse11 (select v_ArrVal_1665 .cse11)) v_ArrVal_1665)))) (not (= v_ArrVal_1664 (store (store .cse12 .cse10 (select v_ArrVal_1664 .cse10)) .cse11 (select v_ArrVal_1664 .cse11)))))))) is different from false [2023-12-19 17:17:15,054 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (and (forall ((v_ArrVal_1664 (Array Int Int))) (or (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))) (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse14 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse13 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse8 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse10 (+ .cse14 8)) (.cse11 (+ .cse14 4))) (or (forall ((v_prenex_4518 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_prenex_4517 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse4 (select v_ArrVal_1669 .cse14)) (.cse5 (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse9 (select .cse7 .cse8))) (let ((.cse12 (select .cse9 .cse14))) (let ((.cse6 (store (store .cse13 .cse8 v_ArrVal_1669) .cse12 v_prenex_4517))) (select (select .cse6 (select (select (store (store .cse7 .cse8 (store (store .cse9 .cse10 v_DerPreprocessor_71) .cse11 v_ArrVal_1668)) .cse12 v_prenex_4518) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse6 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (or (= .cse4 (+ .cse5 4)) (= .cse4 .cse5)))) (not (= v_ArrVal_1669 (store (store (select .cse13 .cse8) .cse10 (select v_ArrVal_1669 .cse10)) .cse11 (select v_ArrVal_1669 .cse11)))))))))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))) (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse15 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse23 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse18 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse20 (+ .cse15 8)) (.cse21 (+ .cse15 4))) (or (forall ((v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int) (v_prenex_4516 (Array Int Int)) (v_prenex_4515 (Array Int Int))) (= (select v_ArrVal_1669 .cse15) (let ((.cse17 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse19 (select .cse17 .cse18))) (let ((.cse22 (select .cse19 .cse15))) (let ((.cse16 (store (store .cse23 .cse18 v_ArrVal_1669) .cse22 v_prenex_4515))) (select (select .cse16 (select (select (store (store .cse17 .cse18 (store (store .cse19 .cse20 v_DerPreprocessor_71) .cse21 v_ArrVal_1668)) .cse22 v_prenex_4516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse16 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))))))) (not (= v_ArrVal_1669 (store (store (select .cse23 .cse18) .cse20 (select v_ArrVal_1669 .cse20)) .cse21 (select v_ArrVal_1669 .cse21)))))))))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse26 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse34 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse29 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse31 (+ .cse26 8)) (.cse32 (+ .cse26 4))) (or (forall ((v_DerPreprocessor_71 Int) (v_prenex_4522 (Array Int Int)) (v_prenex_4521 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse25 (let ((.cse28 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse30 (select .cse28 .cse29))) (let ((.cse33 (select .cse30 .cse26))) (let ((.cse27 (store (store .cse34 .cse29 v_ArrVal_1669) .cse33 v_prenex_4521))) (select (select .cse27 (select (select (store (store .cse28 .cse29 (store (store .cse30 .cse31 v_DerPreprocessor_71) .cse32 v_ArrVal_1668)) .cse33 v_prenex_4522) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select (select .cse27 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))))))) (.cse24 (select v_ArrVal_1669 .cse26))) (or (= .cse24 .cse25) (= .cse25 (+ .cse24 4))))) (not (= v_ArrVal_1669 (store (store (select .cse34 .cse29) .cse31 (select v_ArrVal_1669 .cse31)) .cse32 (select v_ArrVal_1669 .cse32)))))))))) (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))) (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse39 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse37 (+ .cse39 8)) (.cse38 (+ .cse39 4)) (.cse35 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse36 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (= v_ArrVal_1669 (store (store (select .cse35 .cse36) .cse37 (select v_ArrVal_1669 .cse37)) .cse38 (select v_ArrVal_1669 .cse38)))) (forall ((v_DerPreprocessor_71 Int) (v_prenex_4513 (Array Int Int)) (v_ArrVal_1668 Int) (v_prenex_4514 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse46 (select .cse45 .cse36))) (let ((.cse44 (select .cse46 .cse39))) (let ((.cse40 (store (store .cse35 .cse36 v_ArrVal_1669) .cse44 v_prenex_4513)) (.cse43 (store (store .cse45 .cse36 (store (store .cse46 .cse37 v_DerPreprocessor_71) .cse38 v_ArrVal_1668)) .cse44 v_prenex_4514))) (let ((.cse41 (select (select .cse43 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse42 (select (select .cse40 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select v_ArrVal_1669 .cse39) (+ 4 (select (select .cse40 .cse41) .cse42))) (= (select (select .cse43 .cse41) .cse42) .cse44)))))))))))))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse55 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse49 (+ .cse55 8)) (.cse50 (+ .cse55 4)) (.cse47 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse48 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (= v_ArrVal_1669 (store (store (select .cse47 .cse48) .cse49 (select v_ArrVal_1669 .cse49)) .cse50 (select v_ArrVal_1669 .cse50)))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1672 (Array Int Int)) (v_ArrVal_1668 Int)) (let ((.cse52 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse53 (select .cse52 .cse48))) (let ((.cse54 (select .cse53 .cse55))) (= (select (let ((.cse51 (store (store .cse52 .cse48 (store (store .cse53 .cse49 v_DerPreprocessor_71) .cse50 v_ArrVal_1668)) .cse54 v_ArrVal_1672))) (select .cse51 (select (select .cse51 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (select (select (store (store .cse47 .cse48 v_ArrVal_1669) .cse54 v_ArrVal_1677) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse54))))))))))) (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))))) (forall ((v_ArrVal_1664 (Array Int Int))) (or (not (= v_ArrVal_1664 (store (store .cse0 .cse1 (select v_ArrVal_1664 .cse1)) .cse2 (select v_ArrVal_1664 .cse2)))) (forall ((v_ArrVal_1665 (Array Int Int))) (or (not (= v_ArrVal_1665 (store (store .cse3 .cse1 (select v_ArrVal_1665 .cse1)) .cse2 (select v_ArrVal_1665 .cse2)))) (forall ((v_ArrVal_1669 (Array Int Int))) (let ((.cse65 (select v_ArrVal_1665 |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse58 (+ .cse65 8)) (.cse59 (+ .cse65 4)) (.cse56 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1665)) (.cse57 (select v_ArrVal_1664 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (not (= v_ArrVal_1669 (store (store (select .cse56 .cse57) .cse58 (select v_ArrVal_1669 .cse58)) .cse59 (select v_ArrVal_1669 .cse59)))) (forall ((v_prenex_4519 (Array Int Int)) (v_prenex_4520 (Array Int Int)) (v_DerPreprocessor_71 Int) (v_ArrVal_1668 Int)) (let ((.cse66 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_1664))) (let ((.cse67 (select .cse66 .cse57))) (let ((.cse63 (select .cse67 .cse65))) (let ((.cse64 (store (store .cse56 .cse57 v_ArrVal_1669) .cse63 v_prenex_4519)) (.cse60 (store (store .cse66 .cse57 (store (store .cse67 .cse58 v_DerPreprocessor_71) .cse59 v_ArrVal_1668)) .cse63 v_prenex_4520))) (let ((.cse61 (select (select .cse60 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse62 (select (select .cse64 |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select .cse60 .cse61) .cse62) .cse63) (= (select (select .cse64 .cse61) .cse62) (+ (select v_ArrVal_1669 .cse65) 4))))))))))))))))))) is different from false [2023-12-19 17:17:52,260 WARN L293 SmtUtils]: Spent 35.58s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-19 17:17:52,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:17:52,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 1585 treesize of output 1925 [2023-12-19 17:18:19,503 WARN L293 SmtUtils]: Spent 27.20s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-19 17:18:19,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:18:19,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 1507 treesize of output 1847 [2023-12-19 17:18:20,296 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 17 treesize of output 13 [2023-12-19 17:18:20,343 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 17 treesize of output 13 [2023-12-19 17:18:20,530 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 17 treesize of output 13 [2023-12-19 17:18:20,579 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 17 treesize of output 13 [2023-12-19 17:18:20,851 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 17 treesize of output 13 [2023-12-19 17:18:21,783 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 17 treesize of output 13 [2023-12-19 17:18:22,030 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 17 treesize of output 13 [2023-12-19 17:18:22,062 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 17 treesize of output 13 [2023-12-19 17:18:22,117 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 17 treesize of output 13 [2023-12-19 17:18:22,378 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 17 treesize of output 13 [2023-12-19 17:18:22,615 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 17 treesize of output 13 [2023-12-19 17:18:22,641 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 17 treesize of output 13 [2023-12-19 17:18:22,860 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 17 treesize of output 13 [2023-12-19 17:18:22,917 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 17 treesize of output 13 [2023-12-19 17:18:23,098 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 17 treesize of output 13 [2023-12-19 17:18:23,850 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 17 treesize of output 13 [2023-12-19 17:18:23,907 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 17 treesize of output 13 [2023-12-19 17:18:23,990 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 17 treesize of output 13 [2023-12-19 17:18:24,155 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 17 treesize of output 13 [2023-12-19 17:18:24,302 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 17 treesize of output 13 [2023-12-19 17:18:25,066 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 17 treesize of output 13 [2023-12-19 17:18:25,143 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 17 treesize of output 13 [2023-12-19 17:18:25,242 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 17 treesize of output 13 [2023-12-19 17:18:25,449 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 17 treesize of output 13 [2023-12-19 17:18:25,501 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 17 treesize of output 13 [2023-12-19 17:18:25,753 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 17 treesize of output 13 [2023-12-19 17:18:25,772 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 17 treesize of output 13 [2023-12-19 17:18:25,985 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 17 treesize of output 13 [2023-12-19 17:18:26,053 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 17 treesize of output 13 [2023-12-19 17:18:26,149 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 17 treesize of output 13 [2023-12-19 17:18:26,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2023-12-19 17:18:26,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2023-12-19 17:18:26,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2023-12-19 17:18:26,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2023-12-19 17:18:26,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2023-12-19 17:18:27,046 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 17 treesize of output 13 [2023-12-19 17:18:27,096 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 17 treesize of output 13 [2023-12-19 17:18:27,289 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 17 treesize of output 13 [2023-12-19 17:18:27,413 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 17 treesize of output 13 [2023-12-19 17:18:27,522 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 17 treesize of output 13 [2023-12-19 17:18:27,651 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 17 treesize of output 13 [2023-12-19 17:18:27,785 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 17 treesize of output 13 [2023-12-19 17:18:27,804 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 17 treesize of output 13 [2023-12-19 17:18:28,014 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 17 treesize of output 13 [2023-12-19 17:18:28,170 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 17 treesize of output 13 [2023-12-19 17:18:28,289 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 17 treesize of output 13 [2023-12-19 17:18:28,306 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 17 treesize of output 13 [2023-12-19 17:18:28,395 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 17 treesize of output 13 [2023-12-19 17:18:28,622 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 17 treesize of output 13 [2023-12-19 17:18:28,753 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 17 treesize of output 13 [2023-12-19 17:18:29,301 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 17 treesize of output 13 [2023-12-19 17:18:29,392 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 17 treesize of output 13 [2023-12-19 17:18:29,601 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 17 treesize of output 13 [2023-12-19 17:18:29,675 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 17 treesize of output 13 [2023-12-19 17:18:29,803 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 17 treesize of output 13 [2023-12-19 17:18:30,481 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 17 treesize of output 13 [2023-12-19 17:18:30,489 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 17 treesize of output 13 [2023-12-19 17:18:30,600 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 17 treesize of output 13 [2023-12-19 17:18:30,608 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 17 treesize of output 13 [2023-12-19 17:18:30,772 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 17 treesize of output 13 [2023-12-19 17:18:30,786 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 17 treesize of output 13 [2023-12-19 17:18:30,949 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 17 treesize of output 13 [2023-12-19 17:18:31,070 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 17 treesize of output 13 [2023-12-19 17:18:31,139 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 17 treesize of output 13 [2023-12-19 17:18:31,273 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 17 treesize of output 13 [2023-12-19 17:18:32,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:18:32,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 24 [2023-12-19 17:18:32,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:18:32,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:18:32,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:18:33,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:18:33,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:18:33,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:18:33,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:18:33,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2023-12-19 17:18:44,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:18:44,519 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 1883 treesize of output 1708 [2023-12-19 17:18:51,254 WARN L293 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 363 DAG size of output: 343 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-19 17:18:51,254 INFO L349 Elim1Store]: treesize reduction 345, result has 91.4 percent of original size [2023-12-19 17:18:51,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 115066 treesize of output 113166 [2023-12-19 17:18:51,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:18:51,757 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 36135 treesize of output 23743 [2023-12-19 17:18:54,123 INFO L349 Elim1Store]: treesize reduction 38, result has 93.9 percent of original size [2023-12-19 17:18:54,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 132167 treesize of output 107625 [2023-12-19 17:18:56,255 INFO L349 Elim1Store]: treesize reduction 48, result has 47.8 percent of original size [2023-12-19 17:18:56,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 4085 treesize of output 4109 [2023-12-19 17:18:57,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:18:57,067 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 5502 treesize of output 5284 [2023-12-19 17:18:57,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:18:57,524 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 4005 treesize of output 3951 [2023-12-19 17:18:58,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:18:58,625 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 4974 treesize of output 4796 [2023-12-19 17:18:59,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:18:59,127 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 3819 treesize of output 3756 [2023-12-19 17:19:00,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:19:00,200 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 3743 treesize of output 3680 [2023-12-19 17:19:01,334 INFO L349 Elim1Store]: treesize reduction 36, result has 51.4 percent of original size [2023-12-19 17:19:01,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 3667 treesize of output 3685 [2023-12-19 17:19:02,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:19:02,259 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 3649 treesize of output 3624 [2023-12-19 17:19:03,386 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 4614 treesize of output 4462 [2023-12-19 17:19:03,876 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 4850 treesize of output 4658 [2023-12-19 17:19:04,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:19:04,432 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 3497 treesize of output 3444 [2023-12-19 17:19:05,767 INFO L349 Elim1Store]: treesize reduction 36, result has 51.4 percent of original size [2023-12-19 17:19:05,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 3431 treesize of output 3453 [2023-12-19 17:19:06,719 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 3417 treesize of output 3393 [2023-12-19 17:19:07,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:19:07,290 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 3822 treesize of output 3724 [2023-12-19 17:19:07,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:19:07,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 3450 treesize of output 3386 [2023-12-19 17:19:08,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:19:08,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 3295 treesize of output 3306 [2023-12-19 17:19:09,629 INFO L349 Elim1Store]: treesize reduction 36, result has 51.4 percent of original size [2023-12-19 17:19:09,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 3285 treesize of output 3303 [2023-12-19 17:19:10,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:19:10,734 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 4326 treesize of output 4148 [2023-12-19 17:19:11,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 17:19:11,360 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 4426 treesize of output 4206 [2023-12-19 17:19:12,109 INFO L349 Elim1Store]: treesize reduction 36, result has 51.4 percent of original size [2023-12-19 17:19:12,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 3089 treesize of output 3111 [2023-12-19 17:19:13,254 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 4008 treesize of output 3896 [2023-12-19 17:19:13,856 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 4248 treesize of output 4070 [2023-12-19 17:19:14,551 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 3908 treesize of output 3756 [2023-12-19 17:19:15,142 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 4094 treesize of output 3894 [2023-12-19 17:22:04,734 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-19 17:22:04,735 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-19 17:22:04,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-12-19 17:22:04,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-19 17:22:04,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-19 17:22:04,936 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:177) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 66 more [2023-12-19 17:22:04,940 INFO L158 Benchmark]: Toolchain (without parser) took 415367.87ms. Allocated memory was 285.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 241.4MB in the beginning and 819.5MB in the end (delta: -578.1MB). Peak memory consumption was 808.4MB. Max. memory is 8.0GB. [2023-12-19 17:22:04,940 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory was 145.6MB in the beginning and 145.4MB in the end (delta: 140.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 17:22:04,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.97ms. Allocated memory is still 285.2MB. Free memory was 241.4MB in the beginning and 224.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-19 17:22:04,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.63ms. Allocated memory is still 285.2MB. Free memory was 224.1MB in the beginning and 222.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 17:22:04,941 INFO L158 Benchmark]: Boogie Preprocessor took 60.17ms. Allocated memory is still 285.2MB. Free memory was 222.0MB in the beginning and 219.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 17:22:04,941 INFO L158 Benchmark]: RCFGBuilder took 246.46ms. Allocated memory is still 285.2MB. Free memory was 219.4MB in the beginning and 205.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-19 17:22:04,941 INFO L158 Benchmark]: TraceAbstraction took 414719.14ms. Allocated memory was 285.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 205.2MB in the beginning and 819.5MB in the end (delta: -614.3MB). Peak memory consumption was 772.7MB. Max. memory is 8.0GB. [2023-12-19 17:22:04,941 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 195.0MB. Free memory was 145.6MB in the beginning and 145.4MB in the end (delta: 140.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 287.97ms. Allocated memory is still 285.2MB. Free memory was 241.4MB in the beginning and 224.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.63ms. Allocated memory is still 285.2MB. Free memory was 224.1MB in the beginning and 222.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.17ms. Allocated memory is still 285.2MB. Free memory was 222.0MB in the beginning and 219.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 246.46ms. Allocated memory is still 285.2MB. Free memory was 219.4MB in the beginning and 205.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 414719.14ms. Allocated memory was 285.2MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 205.2MB in the beginning and 819.5MB in the end (delta: -614.3MB). Peak memory consumption was 772.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...