./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/simple_built_from_end.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:32:18,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:32:19,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:32:19,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:32:19,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:32:19,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:32:19,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:32:19,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:32:19,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:32:19,091 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:32:19,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:32:19,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:32:19,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:32:19,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:32:19,091 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:32:19,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:32:19,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:32:19,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:32:19,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:32:19,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:32:19,094 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:32:19,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:32:19,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:32:19,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:32:19,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:32:19,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:32:19,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:32:19,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:32:19,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2025-03-08 04:32:19,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:32:19,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:32:19,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:32:19,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:32:19,321 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:32:19,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2025-03-08 04:32:20,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4719065b0/b0ba6d5fed23403092dc243328547ef2/FLAGa8e907410 [2025-03-08 04:32:20,882 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:32:20,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2025-03-08 04:32:20,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4719065b0/b0ba6d5fed23403092dc243328547ef2/FLAGa8e907410 [2025-03-08 04:32:20,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4719065b0/b0ba6d5fed23403092dc243328547ef2 [2025-03-08 04:32:20,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:32:20,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:32:20,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:32:20,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:32:20,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:32:20,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:32:20" (1/1) ... [2025-03-08 04:32:20,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce7c185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:20, skipping insertion in model container [2025-03-08 04:32:20,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:32:20" (1/1) ... [2025-03-08 04:32:20,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:32:21,190 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2025-03-08 04:32:21,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:32:21,205 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:32:21,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2025-03-08 04:32:21,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:32:21,267 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:32:21,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21 WrapperNode [2025-03-08 04:32:21,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:32:21,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:32:21,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:32:21,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:32:21,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,298 INFO L138 Inliner]: procedures = 124, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-08 04:32:21,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:32:21,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:32:21,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:32:21,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:32:21,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,317 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-08 04:32:21,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:32:21,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:32:21,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:32:21,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:32:21,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (1/1) ... [2025-03-08 04:32:21,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:32:21,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:32:21,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:32:21,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:32:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:32:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:32:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:32:21,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:32:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:32:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:32:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:32:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:32:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:32:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:32:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:32:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:32:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:32:21,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:32:21,488 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:32:21,490 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:32:21,581 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-08 04:32:21,586 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 04:32:21,586 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:32:21,593 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:32:21,594 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:32:21,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:32:21 BoogieIcfgContainer [2025-03-08 04:32:21,594 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:32:21,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:32:21,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:32:21,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:32:21,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:32:20" (1/3) ... [2025-03-08 04:32:21,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77762b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:32:21, skipping insertion in model container [2025-03-08 04:32:21,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:32:21" (2/3) ... [2025-03-08 04:32:21,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77762b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:32:21, skipping insertion in model container [2025-03-08 04:32:21,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:32:21" (3/3) ... [2025-03-08 04:32:21,603 INFO L128 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2025-03-08 04:32:21,618 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:32:21,619 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple_built_from_end.i that has 1 procedures, 15 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 04:32:21,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:32:21,673 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@6700f4fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:32:21,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:32:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:21,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 04:32:21,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:21,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 04:32:21,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:21,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:21,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1478175731, now seen corresponding path program 1 times [2025-03-08 04:32:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:21,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696649258] [2025-03-08 04:32:21,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:21,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:21,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 04:32:21,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 04:32:21,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:21,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:21,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:21,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696649258] [2025-03-08 04:32:21,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696649258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:32:21,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:32:21,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:32:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606778614] [2025-03-08 04:32:21,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:32:21,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:32:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:32:21,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:32:21,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:32:21,823 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:32:21,834 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2025-03-08 04:32:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:32:21,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-03-08 04:32:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:32:21,841 INFO L225 Difference]: With dead ends: 23 [2025-03-08 04:32:21,841 INFO L226 Difference]: Without dead ends: 11 [2025-03-08 04:32:21,843 INFO L434 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 [2025-03-08 04:32:21,846 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:32:21,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:32:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-08 04:32:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-08 04:32:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-03-08 04:32:21,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2025-03-08 04:32:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:32:21,872 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-08 04:32:21,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2025-03-08 04:32:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 04:32:21,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:21,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:32:21,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:32:21,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:21,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:21,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1421846041, now seen corresponding path program 1 times [2025-03-08 04:32:21,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:21,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180457178] [2025-03-08 04:32:21,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:21,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:21,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 04:32:21,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 04:32:21,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:21,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:21,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:21,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180457178] [2025-03-08 04:32:21,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180457178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:32:21,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:32:21,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:32:21,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105891822] [2025-03-08 04:32:21,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:32:21,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:32:21,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:32:21,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:32:21,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:32:21,934 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:32:21,946 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-08 04:32:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:32:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-03-08 04:32:21,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:32:21,947 INFO L225 Difference]: With dead ends: 21 [2025-03-08 04:32:21,947 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 04:32:21,947 INFO L434 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 [2025-03-08 04:32:21,948 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:32:21,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:32:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 04:32:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-03-08 04:32:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-03-08 04:32:21,951 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 7 [2025-03-08 04:32:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:32:21,952 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-08 04:32:21,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-03-08 04:32:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:32:21,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:21,952 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:32:21,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:32:21,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:21,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:21,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1425460500, now seen corresponding path program 1 times [2025-03-08 04:32:21,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:21,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821644576] [2025-03-08 04:32:21,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:21,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:21,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 04:32:21,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:32:21,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:21,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:22,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:22,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821644576] [2025-03-08 04:32:22,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821644576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:32:22,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:32:22,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:32:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087591588] [2025-03-08 04:32:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:32:22,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:32:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:32:22,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:32:22,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:32:22,166 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2025-03-08 04:32:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:32:22,212 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-03-08 04:32:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:32:22,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 [2025-03-08 04:32:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:32:22,214 INFO L225 Difference]: With dead ends: 20 [2025-03-08 04:32:22,214 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 04:32:22,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:32:22,215 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:32:22,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:32:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 04:32:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2025-03-08 04:32:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-08 04:32:22,221 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2025-03-08 04:32:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:32:22,222 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-08 04:32:22,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2025-03-08 04:32:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-08 04:32:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 04:32:22,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:22,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:32:22,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:32:22,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:22,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:22,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1551230116, now seen corresponding path program 1 times [2025-03-08 04:32:22,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:22,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388139863] [2025-03-08 04:32:22,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:22,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:22,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 04:32:22,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 04:32:22,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:22,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:22,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:22,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388139863] [2025-03-08 04:32:22,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388139863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:32:22,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404564657] [2025-03-08 04:32:22,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:32:22,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:22,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:32:22,600 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) [2025-03-08 04:32:22,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:32:22,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 04:32:22,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 04:32:22,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:32:22,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:22,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 04:32:22,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:32:22,742 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 [2025-03-08 04:32:22,750 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 [2025-03-08 04:32:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:22,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:32:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:22,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404564657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:32:22,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:32:22,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 6 [2025-03-08 04:32:22,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736359641] [2025-03-08 04:32:22,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:32:22,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:32:22,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:32:22,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:32:22,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:32:22,888 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:32:22,914 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-08 04:32:22,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:32:22,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 14 [2025-03-08 04:32:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:32:22,915 INFO L225 Difference]: With dead ends: 30 [2025-03-08 04:32:22,915 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 04:32:22,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:32:22,916 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:32:22,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:32:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 04:32:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-08 04:32:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-03-08 04:32:22,919 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2025-03-08 04:32:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:32:22,919 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-03-08 04:32:22,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-03-08 04:32:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:32:22,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:22,920 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:32:22,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:32:23,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:23,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:23,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1187970377, now seen corresponding path program 2 times [2025-03-08 04:32:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:23,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140667569] [2025-03-08 04:32:23,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:32:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:23,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 04:32:23,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:32:23,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:32:23,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:23,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:23,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140667569] [2025-03-08 04:32:23,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140667569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:32:23,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740575040] [2025-03-08 04:32:23,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:32:23,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:23,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:32:23,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:32:23,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:32:23,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 04:32:23,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:32:23,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:32:23,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:23,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 04:32:23,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:32:23,778 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 [2025-03-08 04:32:23,800 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 18 treesize of output 7 [2025-03-08 04:32:23,836 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:32:23,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 04:32:23,869 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 15 [2025-03-08 04:32:23,875 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 [2025-03-08 04:32:23,880 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 [2025-03-08 04:32:23,963 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 27 treesize of output 15 [2025-03-08 04:32:23,969 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 [2025-03-08 04:32:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:23,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:32:24,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:24,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-03-08 04:32:24,110 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 22 [2025-03-08 04:32:24,114 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 [2025-03-08 04:32:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:24,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740575040] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:32:24,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:32:24,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-08 04:32:24,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488881414] [2025-03-08 04:32:24,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:32:24,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:32:24,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:32:24,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:32:24,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=144, Unknown=2, NotChecked=0, Total=182 [2025-03-08 04:32:24,140 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:32:24,320 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-03-08 04:32:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 04:32:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 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 18 [2025-03-08 04:32:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:32:24,321 INFO L225 Difference]: With dead ends: 27 [2025-03-08 04:32:24,321 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 04:32:24,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=253, Unknown=2, NotChecked=0, Total=342 [2025-03-08 04:32:24,322 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:32:24,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:32:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 04:32:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2025-03-08 04:32:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-08 04:32:24,326 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2025-03-08 04:32:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:32:24,326 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-08 04:32:24,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-08 04:32:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 04:32:24,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:24,327 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-08 04:32:24,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 04:32:24,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:24,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:24,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:24,528 INFO L85 PathProgramCache]: Analyzing trace with hash -294112335, now seen corresponding path program 3 times [2025-03-08 04:32:24,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:24,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919821335] [2025-03-08 04:32:24,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:32:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:24,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-08 04:32:24,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:32:24,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:32:24,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:24,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919821335] [2025-03-08 04:32:24,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919821335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:32:24,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832511640] [2025-03-08 04:32:24,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:32:24,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:24,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:32:25,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:32:25,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:32:25,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-08 04:32:25,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:32:25,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:32:25,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:25,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 04:32:25,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:32:25,098 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 [2025-03-08 04:32:25,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 04:32:25,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 04:32:25,156 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:32:25,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 04:32:25,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-08 04:32:25,201 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 [2025-03-08 04:32:25,206 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 26 treesize of output 21 [2025-03-08 04:32:25,212 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 26 treesize of output 21 [2025-03-08 04:32:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:25,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:32:25,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:25,454 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 17 treesize of output 21 [2025-03-08 04:32:25,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:25,468 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 17 treesize of output 21 [2025-03-08 04:32:25,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:25,650 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 26 treesize of output 27 [2025-03-08 04:32:25,654 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 42 treesize of output 26 [2025-03-08 04:32:25,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:25,664 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 13 treesize of output 22 [2025-03-08 04:32:25,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:25,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-08 04:32:25,686 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:32:25,687 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 20 treesize of output 8 [2025-03-08 04:32:25,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-08 04:32:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832511640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:32:25,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:32:25,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-08 04:32:25,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756529962] [2025-03-08 04:32:25,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:32:25,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 04:32:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:32:25,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 04:32:25,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=244, Unknown=8, NotChecked=0, Total=306 [2025-03-08 04:32:25,777 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 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) [2025-03-08 04:32:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:32:25,972 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2025-03-08 04:32:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:32:25,972 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 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) Word has length 21 [2025-03-08 04:32:25,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:32:25,973 INFO L225 Difference]: With dead ends: 40 [2025-03-08 04:32:25,973 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 04:32:25,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=337, Unknown=9, NotChecked=0, Total=420 [2025-03-08 04:32:25,977 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:32:25,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 102 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:32:25,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 04:32:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-08 04:32:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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) [2025-03-08 04:32:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-08 04:32:25,981 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2025-03-08 04:32:25,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:32:25,981 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-08 04:32:25,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 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) [2025-03-08 04:32:25,981 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-03-08 04:32:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 04:32:25,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:25,981 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-08 04:32:25,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 04:32:26,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:26,184 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:26,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1855610870, now seen corresponding path program 4 times [2025-03-08 04:32:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474422032] [2025-03-08 04:32:26,185 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:32:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:26,201 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 04:32:26,226 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 25 statements. [2025-03-08 04:32:26,227 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 04:32:26,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:26,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:26,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474422032] [2025-03-08 04:32:26,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474422032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:32:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20867458] [2025-03-08 04:32:26,976 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:32:26,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:26,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:32:26,978 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:32:26,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:32:27,026 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 04:32:27,062 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 25 statements. [2025-03-08 04:32:27,062 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 04:32:27,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:27,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 04:32:27,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:32:27,070 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 [2025-03-08 04:32:27,097 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 18 treesize of output 7 [2025-03-08 04:32:27,144 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:32:27,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 04:32:27,193 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 22 treesize of output 17 [2025-03-08 04:32:27,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 04:32:27,205 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 19 treesize of output 1 [2025-03-08 04:32:27,268 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-03-08 04:32:27,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2025-03-08 04:32:27,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-08 04:32:27,340 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 58 treesize of output 41 [2025-03-08 04:32:27,346 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 [2025-03-08 04:32:27,352 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 30 treesize of output 25 [2025-03-08 04:32:27,360 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 26 treesize of output 21 [2025-03-08 04:32:27,648 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-08 04:32:27,648 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 104 treesize of output 39 [2025-03-08 04:32:27,653 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 04:32:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:27,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:32:27,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:27,842 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 38 treesize of output 42 [2025-03-08 04:32:27,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:27,847 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 33 treesize of output 37 [2025-03-08 04:32:28,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:28,036 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 59 treesize of output 60 [2025-03-08 04:32:28,042 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 108 treesize of output 92 [2025-03-08 04:32:28,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:28,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2025-03-08 04:32:28,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:28,060 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 82 treesize of output 70 [2025-03-08 04:32:28,065 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 122 treesize of output 98 [2025-03-08 04:32:28,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:28,078 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 34 treesize of output 40 [2025-03-08 04:32:32,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:32,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 45 [2025-03-08 04:32:32,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:32,474 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 111 treesize of output 110 [2025-03-08 04:32:32,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:32,494 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 93 treesize of output 107 [2025-03-08 04:32:32,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:32,507 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 45 treesize of output 49 [2025-03-08 04:32:32,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:32,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2025-03-08 04:32:32,666 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 52 [2025-03-08 04:32:32,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:32:32,674 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 46 treesize of output 48 [2025-03-08 04:32:32,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-08 04:32:32,815 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 17 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:32,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20867458] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:32:32,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:32:32,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 34 [2025-03-08 04:32:32,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370319886] [2025-03-08 04:32:32,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:32:32,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 04:32:32,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:32:32,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 04:32:32,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=996, Unknown=13, NotChecked=0, Total=1122 [2025-03-08 04:32:32,819 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:32:33,390 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-03-08 04:32:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 04:32:33,391 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 04:32:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:32:33,391 INFO L225 Difference]: With dead ends: 34 [2025-03-08 04:32:33,391 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 04:32:33,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=286, Invalid=1507, Unknown=13, NotChecked=0, Total=1806 [2025-03-08 04:32:33,392 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 42 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:32:33,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 143 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:32:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 04:32:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-08 04:32:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-03-08 04:32:33,397 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2025-03-08 04:32:33,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:32:33,397 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-03-08 04:32:33,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:32:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-03-08 04:32:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 04:32:33,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:32:33,398 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-08 04:32:33,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 04:32:33,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:33,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:32:33,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:32:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash -19768814, now seen corresponding path program 5 times [2025-03-08 04:32:33,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:32:33,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127973252] [2025-03-08 04:32:33,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:32:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:32:33,615 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-03-08 04:32:33,628 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:32:33,629 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 04:32:33,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:32:34,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:32:34,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127973252] [2025-03-08 04:32:34,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127973252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:32:34,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158443439] [2025-03-08 04:32:34,333 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:32:34,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:34,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:32:34,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:32:34,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:32:34,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-03-08 04:32:34,417 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:32:34,417 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 04:32:34,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:32:34,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-08 04:32:34,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:32:34,431 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 [2025-03-08 04:32:34,441 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 [2025-03-08 04:32:34,446 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 [2025-03-08 04:32:34,467 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:32:34,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 04:32:34,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2025-03-08 04:32:34,515 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 11 treesize of output 14 [2025-03-08 04:32:34,520 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 22 treesize of output 17 [2025-03-08 04:32:34,528 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 22 treesize of output 17 [2025-03-08 04:32:34,589 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-03-08 04:32:34,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2025-03-08 04:32:34,654 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 [2025-03-08 04:32:34,669 INFO L349 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2025-03-08 04:32:34,669 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 72 treesize of output 74 [2025-03-08 04:32:34,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-08 04:32:34,686 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 47 treesize of output 45 [2025-03-08 04:32:58,469 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") [2025-03-08 04:32:58,469 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-08 04:32:58,470 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 [2025-03-08 04:32:58,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 04:32:58,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:32:58,671 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.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) 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:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) 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) ... 45 more [2025-03-08 04:32:58,675 INFO L158 Benchmark]: Toolchain (without parser) took 37764.37ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 103.9MB in the beginning and 253.5MB in the end (delta: -149.6MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2025-03-08 04:32:58,675 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:32:58,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.67ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 86.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:32:58,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.42ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 84.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:32:58,676 INFO L158 Benchmark]: Boogie Preprocessor took 26.75ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 83.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:32:58,676 INFO L158 Benchmark]: IcfgBuilder took 267.80ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 71.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:32:58,677 INFO L158 Benchmark]: TraceAbstraction took 37078.23ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 71.7MB in the beginning and 253.5MB in the end (delta: -181.9MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2025-03-08 04:32:58,677 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.67ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 86.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.42ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 84.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.75ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 83.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 267.80ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 71.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 37078.23ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 71.7MB in the beginning and 253.5MB in the end (delta: -181.9MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:33:00,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:33:00,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 04:33:00,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:33:00,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:33:00,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:33:00,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:33:00,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:33:00,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:33:00,468 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:33:00,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:33:00,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:33:00,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:33:00,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:33:00,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:33:00,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:33:00,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:33:00,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:33:00,471 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2025-03-08 04:33:00,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:33:00,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:33:00,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:33:00,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:33:00,717 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:33:00,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2025-03-08 04:33:01,901 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a68eae4/20c1f7bdef264196b9605af5870fc1e9/FLAG5a3d98a1b [2025-03-08 04:33:02,118 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:33:02,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2025-03-08 04:33:02,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a68eae4/20c1f7bdef264196b9605af5870fc1e9/FLAG5a3d98a1b [2025-03-08 04:33:02,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a68eae4/20c1f7bdef264196b9605af5870fc1e9 [2025-03-08 04:33:02,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:33:02,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:33:02,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:33:02,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:33:02,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:33:02,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f10641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02, skipping insertion in model container [2025-03-08 04:33:02,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:33:02,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2025-03-08 04:33:02,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:33:02,687 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:33:02,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i[23125,23138] [2025-03-08 04:33:02,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:33:02,751 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:33:02,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02 WrapperNode [2025-03-08 04:33:02,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:33:02,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:33:02,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:33:02,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:33:02,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,791 INFO L138 Inliner]: procedures = 127, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-08 04:33:02,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:33:02,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:33:02,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:33:02,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:33:02,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,822 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-08 04:33:02,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:33:02,830 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:33:02,830 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:33:02,830 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:33:02,831 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (1/1) ... [2025-03-08 04:33:02,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:33:02,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:02,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:33:02,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 04:33:02,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:33:02,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:33:02,988 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:33:02,990 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:33:03,106 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-08 04:33:03,112 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 04:33:03,112 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:33:03,119 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:33:03,119 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:33:03,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:33:03 BoogieIcfgContainer [2025-03-08 04:33:03,119 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:33:03,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:33:03,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:33:03,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:33:03,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:33:02" (1/3) ... [2025-03-08 04:33:03,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8e9c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:33:03, skipping insertion in model container [2025-03-08 04:33:03,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:33:02" (2/3) ... [2025-03-08 04:33:03,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8e9c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:33:03, skipping insertion in model container [2025-03-08 04:33:03,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:33:03" (3/3) ... [2025-03-08 04:33:03,128 INFO L128 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2025-03-08 04:33:03,139 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:33:03,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple_built_from_end.i that has 1 procedures, 15 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 04:33:03,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:33:03,191 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@6e29a8af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:33:03,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:33:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 04:33:03,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:03,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 04:33:03,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:03,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:03,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1478175731, now seen corresponding path program 1 times [2025-03-08 04:33:03,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:33:03,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107486376] [2025-03-08 04:33:03,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:03,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:03,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:03,217 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) [2025-03-08 04:33:03,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:33:03,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 04:33:03,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 04:33:03,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:03,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:03,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 04:33:03,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:03,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:33:03,299 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:33:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107486376] [2025-03-08 04:33:03,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107486376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:33:03,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:33:03,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:33:03,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813715357] [2025-03-08 04:33:03,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:33:03,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:33:03,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:33:03,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:33:03,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:33:03,317 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:03,327 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2025-03-08 04:33:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:33:03,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-03-08 04:33:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:03,335 INFO L225 Difference]: With dead ends: 23 [2025-03-08 04:33:03,335 INFO L226 Difference]: Without dead ends: 11 [2025-03-08 04:33:03,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:33:03,341 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:03,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-03-08 04:33:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-08 04:33:03,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:03,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-03-08 04:33:03,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2025-03-08 04:33:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:03,364 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-08 04:33:03,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2025-03-08 04:33:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 04:33:03,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:03,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:33:03,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:33:03,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:03,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:03,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:03,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1421846041, now seen corresponding path program 1 times [2025-03-08 04:33:03,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:33:03,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1031034157] [2025-03-08 04:33:03,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:03,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:03,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:03,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:03,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:33:03,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 04:33:03,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 04:33:03,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:03,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:03,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 04:33:03,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:03,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:33:03,690 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:33:03,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031034157] [2025-03-08 04:33:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031034157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:33:03,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:33:03,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:33:03,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234263522] [2025-03-08 04:33:03,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:33:03,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:33:03,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:33:03,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:33:03,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:33:03,706 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:03,722 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-08 04:33:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:33:03,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-03-08 04:33:03,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:03,723 INFO L225 Difference]: With dead ends: 21 [2025-03-08 04:33:03,723 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 04:33:03,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:33:03,723 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:03,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 04:33:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-03-08 04:33:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-03-08 04:33:03,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 7 [2025-03-08 04:33:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:03,728 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-08 04:33:03,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-03-08 04:33:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:33:03,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:03,728 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:33:03,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 04:33:03,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:03,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:03,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1425460500, now seen corresponding path program 1 times [2025-03-08 04:33:03,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:33:03,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371715104] [2025-03-08 04:33:03,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:03,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:03,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:03,935 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:03,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:33:03,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 04:33:03,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:33:03,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:03,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:03,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 04:33:03,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:04,022 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 22 treesize of output 7 [2025-03-08 04:33:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:04,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:33:04,056 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:33:04,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371715104] [2025-03-08 04:33:04,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371715104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:33:04,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:33:04,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:33:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030661156] [2025-03-08 04:33:04,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:33:04,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:33:04,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:33:04,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:33:04,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:33:04,057 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2025-03-08 04:33:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:04,098 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-03-08 04:33:04,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:33:04,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 [2025-03-08 04:33:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:04,099 INFO L225 Difference]: With dead ends: 20 [2025-03-08 04:33:04,099 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 04:33:04,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:33:04,100 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:04,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:33:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 04:33:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2025-03-08 04:33:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-08 04:33:04,103 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2025-03-08 04:33:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:04,104 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-08 04:33:04,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2025-03-08 04:33:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-08 04:33:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 04:33:04,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:04,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:33:04,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 04:33:04,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:04,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:04,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:04,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1551230116, now seen corresponding path program 1 times [2025-03-08 04:33:04,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:33:04,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [785116564] [2025-03-08 04:33:04,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:33:04,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:04,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:04,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:33:04,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 04:33:04,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 04:33:04,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:33:04,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:04,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 04:33:04,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:04,429 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 [2025-03-08 04:33:04,434 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 [2025-03-08 04:33:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:04,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:04,580 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:33:04,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785116564] [2025-03-08 04:33:04,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785116564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:04,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:33:04,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2025-03-08 04:33:04,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57056993] [2025-03-08 04:33:04,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:04,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:33:04,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:33:04,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:33:04,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:33:04,581 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:04,674 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-08 04:33:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:33:04,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 14 [2025-03-08 04:33:04,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:04,675 INFO L225 Difference]: With dead ends: 30 [2025-03-08 04:33:04,675 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 04:33:04,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:33:04,676 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:04,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 40 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:33:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 04:33:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-08 04:33:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-03-08 04:33:04,678 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2025-03-08 04:33:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:04,678 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-03-08 04:33:04,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-03-08 04:33:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:33:04,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:04,681 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:33:04,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 04:33:04,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:04,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:04,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:04,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1187970377, now seen corresponding path program 2 times [2025-03-08 04:33:04,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:33:04,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899241604] [2025-03-08 04:33:04,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:33:04,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:04,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:04,888 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:04,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:33:04,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-08 04:33:04,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:33:04,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:33:04,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:04,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 04:33:04,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:04,957 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 7 [2025-03-08 04:33:04,974 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 22 treesize of output 7 [2025-03-08 04:33:05,014 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 04:33:05,014 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 13 treesize of output 13 [2025-03-08 04:33:05,063 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 [2025-03-08 04:33:05,066 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 [2025-03-08 04:33:05,069 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 19 [2025-03-08 04:33:05,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-03-08 04:33:05,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 04:33:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:05,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:05,291 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_14| (_ BitVec 32)) (v_ArrVal_61 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_61) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_14|))))) is different from false [2025-03-08 04:33:05,316 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 36 [2025-03-08 04:33:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 04:33:05,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:33:05,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899241604] [2025-03-08 04:33:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899241604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:05,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:33:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-08 04:33:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402980133] [2025-03-08 04:33:05,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:05,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 04:33:05,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:33:05,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 04:33:05,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=5, NotChecked=16, Total=110 [2025-03-08 04:33:05,337 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:05,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:05,672 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2025-03-08 04:33:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 04:33:05,674 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 04:33:05,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:05,674 INFO L225 Difference]: With dead ends: 27 [2025-03-08 04:33:05,675 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 04:33:05,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=149, Unknown=5, NotChecked=26, Total=240 [2025-03-08 04:33:05,675 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:05,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 48 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2025-03-08 04:33:05,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 04:33:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2025-03-08 04:33:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-08 04:33:05,682 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2025-03-08 04:33:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:05,682 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-08 04:33:05,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-08 04:33:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 04:33:05,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:05,683 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-08 04:33:05,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 04:33:05,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:05,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:05,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash -294112335, now seen corresponding path program 3 times [2025-03-08 04:33:05,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:33:05,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272299373] [2025-03-08 04:33:05,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:33:05,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:05,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:05,902 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:05,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 04:33:05,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-08 04:33:06,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:33:06,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:33:06,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:06,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 04:33:06,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:06,040 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 7 [2025-03-08 04:33:06,076 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 [2025-03-08 04:33:06,085 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 [2025-03-08 04:33:06,147 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-08 04:33:06,147 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 13 treesize of output 13 [2025-03-08 04:33:06,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-08 04:33:06,228 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 15 [2025-03-08 04:33:06,237 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 [2025-03-08 04:33:06,241 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 [2025-03-08 04:33:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:06,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:06,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:06,540 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 17 treesize of output 21 [2025-03-08 04:33:06,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:06,550 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 17 treesize of output 21 [2025-03-08 04:33:07,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:07,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-08 04:33:07,068 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 36 treesize of output 24 [2025-03-08 04:33:07,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:07,080 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 18 treesize of output 20 [2025-03-08 04:33:07,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:07,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-08 04:33:07,134 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 36 treesize of output 24 [2025-03-08 04:33:07,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:07,146 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 18 treesize of output 20 [2025-03-08 04:33:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:07,301 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:33:07,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272299373] [2025-03-08 04:33:07,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272299373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:07,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:33:07,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-08 04:33:07,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59839584] [2025-03-08 04:33:07,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:07,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 04:33:07,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:33:07,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 04:33:07,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=121, Unknown=4, NotChecked=0, Total=156 [2025-03-08 04:33:07,302 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:07,722 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2025-03-08 04:33:07,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:33:07,723 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 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 21 [2025-03-08 04:33:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:07,725 INFO L225 Difference]: With dead ends: 40 [2025-03-08 04:33:07,725 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 04:33:07,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=140, Unknown=4, NotChecked=0, Total=182 [2025-03-08 04:33:07,726 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:07,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 04:33:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 04:33:07,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-08 04:33:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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) [2025-03-08 04:33:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-08 04:33:07,731 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2025-03-08 04:33:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:07,731 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-08 04:33:07,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-03-08 04:33:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 04:33:07,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:07,731 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-08 04:33:07,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 04:33:07,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:07,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:07,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:07,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1855610870, now seen corresponding path program 4 times [2025-03-08 04:33:07,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:33:07,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [27642367] [2025-03-08 04:33:07,933 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:33:07,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:07,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:07,935 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:07,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 04:33:07,977 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-08 04:33:07,994 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 25 statements. [2025-03-08 04:33:07,994 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 04:33:07,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:07,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 04:33:07,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:08,002 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 7 [2025-03-08 04:33:08,011 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 22 treesize of output 7 [2025-03-08 04:33:08,045 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-08 04:33:08,045 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 19 treesize of output 27 [2025-03-08 04:33:08,122 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 [2025-03-08 04:33:08,129 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 19 [2025-03-08 04:33:08,137 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 [2025-03-08 04:33:08,211 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-08 04:33:08,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2025-03-08 04:33:08,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-08 04:33:08,308 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 60 treesize of output 43 [2025-03-08 04:33:08,317 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 27 [2025-03-08 04:33:08,325 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 33 treesize of output 35 [2025-03-08 04:33:08,336 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 [2025-03-08 04:33:08,599 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:33:08,599 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 74 treesize of output 37 [2025-03-08 04:33:08,608 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 26 treesize of output 14 [2025-03-08 04:33:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:08,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:08,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:08,760 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 38 treesize of output 42 [2025-03-08 04:33:08,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:08,770 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 33 treesize of output 37 [2025-03-08 04:33:08,801 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_149 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (or (not (= (select v_arrayElimArr_8 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_7 .cse0))) (= (_ bv1 32) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_149) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1))))))) is different from false [2025-03-08 04:33:08,889 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_24| (_ BitVec 32)) (v_ArrVal_149 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_7 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_24|) (_ bv0 1))) (not (= (select v_arrayElimArr_8 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~t~0#1.base_24| v_ArrVal_149) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_7) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~t~0#1.base_24| v_arrayElimArr_8) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_7 (_ bv4 32)))))) is different from false [2025-03-08 04:33:08,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:08,919 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 55 treesize of output 56 [2025-03-08 04:33:08,925 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 90 [2025-03-08 04:33:08,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:08,933 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 86 treesize of output 76 [2025-03-08 04:33:08,939 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 114 [2025-03-08 04:33:08,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:08,952 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 54 treesize of output 52 [2025-03-08 04:33:08,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:08,964 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 28 treesize of output 30 [2025-03-08 04:33:17,665 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 229 treesize of output 227 [2025-03-08 04:33:17,673 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 150 treesize of output 146 [2025-03-08 04:33:17,690 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 146 treesize of output 144 [2025-03-08 04:33:17,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:17,718 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 34 treesize of output 36 [2025-03-08 04:33:17,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:17,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2025-03-08 04:33:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2025-03-08 04:33:22,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:33:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27642367] [2025-03-08 04:33:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27642367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:22,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:33:22,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2025-03-08 04:33:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050611264] [2025-03-08 04:33:22,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:22,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 04:33:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:33:22,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 04:33:22,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=194, Unknown=6, NotChecked=58, Total=306 [2025-03-08 04:33:22,003 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:25,732 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-03-08 04:33:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 04:33:25,733 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 04:33:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:25,734 INFO L225 Difference]: With dead ends: 34 [2025-03-08 04:33:25,734 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 04:33:25,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=129, Invalid=425, Unknown=6, NotChecked=90, Total=650 [2025-03-08 04:33:25,735 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:25,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 91 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 48 Unchecked, 3.1s Time] [2025-03-08 04:33:25,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 04:33:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-08 04:33:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-03-08 04:33:25,741 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2025-03-08 04:33:25,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:25,742 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-03-08 04:33:25,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-03-08 04:33:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 04:33:25,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:25,744 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-08 04:33:25,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 04:33:25,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:25,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:25,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:25,945 INFO L85 PathProgramCache]: Analyzing trace with hash -19768814, now seen corresponding path program 5 times [2025-03-08 04:33:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:33:25,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301243622] [2025-03-08 04:33:25,945 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:33:25,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:25,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:25,947 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:25,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 04:33:26,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-03-08 04:33:26,389 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:33:26,393 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 04:33:26,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:26,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 04:33:26,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:26,429 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 7 [2025-03-08 04:33:26,490 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 [2025-03-08 04:33:26,498 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 [2025-03-08 04:33:26,552 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-08 04:33:26,552 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 19 treesize of output 27 [2025-03-08 04:33:26,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-08 04:33:26,692 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 15 [2025-03-08 04:33:26,706 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 [2025-03-08 04:33:26,713 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 [2025-03-08 04:33:26,865 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-08 04:33:26,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2025-03-08 04:33:26,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-08 04:33:26,964 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 36 treesize of output 41 [2025-03-08 04:33:26,971 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 [2025-03-08 04:33:26,995 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-08 04:33:26,995 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 67 treesize of output 50 [2025-03-08 04:33:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:27,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:27,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:27,750 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 45 treesize of output 49 [2025-03-08 04:33:27,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:27,759 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 40 treesize of output 39 [2025-03-08 04:33:27,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:27,782 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 45 treesize of output 44 [2025-03-08 04:33:27,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:27,790 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 35 treesize of output 39 [2025-03-08 04:33:32,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:32,523 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 54 treesize of output 53 [2025-03-08 04:33:32,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:32,534 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 44 treesize of output 48 [2025-03-08 04:33:32,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:32,580 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 54 treesize of output 53 [2025-03-08 04:33:32,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:32,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2025-03-08 04:33:32,642 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_30| (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_17 .cse0))) (not (= (select v_arrayElimArr_14 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~t~0#1.base| (select v_arrayElimArr_13 (_ bv4 32)))) (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 32) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_17) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_14))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_18) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_13) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0)) (bvadd (select (select .cse1 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0) (_ bv4 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_30|))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_30| (_ BitVec 32)) (v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_20 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_19 .cse0))) (not (= (select v_arrayElimArr_15 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (= (_ bv0 32) (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_15))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0))) (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_16) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0) (_ bv4 32)))) (not (= (select v_arrayElimArr_16 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_30|))))))) is different from false [2025-03-08 04:33:33,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:33,114 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 75 treesize of output 66 [2025-03-08 04:33:33,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:33,132 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 55 treesize of output 56 [2025-03-08 04:33:33,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:33,223 INFO L349 Elim1Store]: treesize reduction 45, result has 27.4 percent of original size [2025-03-08 04:33:33,223 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 796 treesize of output 718 [2025-03-08 04:33:33,240 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 247 treesize of output 241 [2025-03-08 04:33:33,253 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 86 treesize of output 72 [2025-03-08 04:33:33,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:33,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 43 treesize of output 39 [2025-03-08 04:33:33,299 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 69 treesize of output 57 [2025-03-08 04:33:33,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:33,311 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 54 treesize of output 56 [2025-03-08 04:33:33,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:33,474 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 75 treesize of output 76 [2025-03-08 04:33:33,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:33,489 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 65 treesize of output 56 [2025-03-08 04:33:33,494 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:33:33,497 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 44 treesize of output 38 [2025-03-08 04:33:33,503 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:33:33,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:33,507 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2025-03-08 04:33:33,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:33,527 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 82 treesize of output 72 [2025-03-08 04:33:33,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:33,543 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 77 treesize of output 67 [2025-03-08 04:33:33,549 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 21 [2025-03-08 04:33:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-08 04:33:34,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 04:33:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301243622] [2025-03-08 04:33:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301243622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:33:34,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:33:34,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2025-03-08 04:33:34,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484076196] [2025-03-08 04:33:34,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:33:34,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 04:33:34,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 04:33:34,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 04:33:34,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=248, Unknown=13, NotChecked=32, Total=342 [2025-03-08 04:33:34,332 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:38,807 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (and (= (_ bv0 32) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv4 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~t~0#1.offset|) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base|))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (_ bv4 32)) (_ bv0 32)) (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_30| (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_17 .cse0))) (not (= (select v_arrayElimArr_14 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~t~0#1.base| (select v_arrayElimArr_13 (_ bv4 32)))) (not (= (select v_arrayElimArr_18 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv0 32) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_17) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_14))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_18) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_13) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0)) (bvadd (select (select .cse1 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0) (_ bv4 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_30|))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_30| (_ BitVec 32)) (v_arrayElimArr_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_16 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_20 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_19 .cse0))) (not (= (select v_arrayElimArr_15 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) (= (_ bv0 32) (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_15))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0))) (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) |v_ULTIMATE.start_main_~t~0#1.base_30| v_arrayElimArr_16) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0) (_ bv4 32)))) (not (= (select v_arrayElimArr_16 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_30|))))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|))))) is different from false [2025-03-08 04:33:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:33:40,986 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2025-03-08 04:33:40,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 04:33:40,988 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 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 28 [2025-03-08 04:33:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:33:40,988 INFO L225 Difference]: With dead ends: 50 [2025-03-08 04:33:40,988 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 04:33:40,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=58, Invalid=278, Unknown=14, NotChecked=70, Total=420 [2025-03-08 04:33:40,989 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:33:40,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 62 Unchecked, 2.3s Time] [2025-03-08 04:33:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 04:33:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-08 04:33:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 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) [2025-03-08 04:33:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-03-08 04:33:40,994 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2025-03-08 04:33:40,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:33:40,994 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-03-08 04:33:40,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:33:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-03-08 04:33:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 04:33:40,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:33:40,995 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2025-03-08 04:33:41,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 04:33:41,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:41,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:33:41,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:33:41,196 INFO L85 PathProgramCache]: Analyzing trace with hash 668452397, now seen corresponding path program 6 times [2025-03-08 04:33:41,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 04:33:41,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [532558449] [2025-03-08 04:33:41,196 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 04:33:41,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:33:41,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:33:41,198 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:33:41,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 04:33:41,257 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 5 equivalence classes. [2025-03-08 04:33:41,769 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 04:33:41,769 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 04:33:41,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:33:41,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 04:33:41,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:33:41,781 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 7 [2025-03-08 04:33:41,805 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 18 treesize of output 7 [2025-03-08 04:33:41,869 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-08 04:33:41,869 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 19 treesize of output 27 [2025-03-08 04:33:41,977 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 [2025-03-08 04:33:41,985 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 15 [2025-03-08 04:33:41,998 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 [2025-03-08 04:33:42,114 INFO L349 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2025-03-08 04:33:42,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2025-03-08 04:33:42,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-08 04:33:42,264 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 67 treesize of output 44 [2025-03-08 04:33:42,279 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 24 treesize of output 19 [2025-03-08 04:33:42,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:42,297 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 [2025-03-08 04:33:42,305 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 [2025-03-08 04:33:42,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:42,562 INFO L349 Elim1Store]: treesize reduction 18, result has 58.1 percent of original size [2025-03-08 04:33:42,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 43 [2025-03-08 04:33:42,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-08 04:33:42,766 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-08 04:33:42,766 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 115 treesize of output 68 [2025-03-08 04:33:42,778 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 28 treesize of output 23 [2025-03-08 04:33:42,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:42,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:42,799 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 36 treesize of output 41 [2025-03-08 04:33:42,804 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 [2025-03-08 04:33:43,662 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-08 04:33:43,662 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 121 treesize of output 55 [2025-03-08 04:33:43,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2025-03-08 04:33:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:33:43,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:33:44,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:44,056 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 94 treesize of output 88 [2025-03-08 04:33:44,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:44,067 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 79 treesize of output 73 [2025-03-08 04:33:44,104 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (or (not (= (select v_arrayElimArr_28 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (_ bv1 32) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_28)) (.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_27)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) (not (= (select v_arrayElimArr_27 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|))))) is different from false [2025-03-08 04:33:44,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|))) (not (= (select v_arrayElimArr_28 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_27 (_ bv4 32)) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (_ bv1 32) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_28)) (.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_27)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~p~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) .cse4)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) .cse4)))) (select (select (store |c_#memory_int#1| |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))))) is different from false [2025-03-08 04:33:44,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:44,231 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 123 treesize of output 117 [2025-03-08 04:33:44,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:44,251 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 108 treesize of output 102 [2025-03-08 04:33:44,317 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (let ((.cse1 (select v_arrayElimArr_27 (_ bv4 32))) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~t~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_38|))) (not (= (select v_arrayElimArr_28 (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_29 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_30 .cse0))) (not (= .cse1 |c_ULTIMATE.start_main_~t~0#1.base|)) (= (_ bv1 32) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_29) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_28)) (.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_27))) (let ((.cse3 (select (select .cse2 .cse1) .cse0)) (.cse4 (bvadd (select (select .cse5 .cse1) .cse0) (_ bv4 32)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))))) is different from false [2025-03-08 04:33:44,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_30 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (let ((.cse0 (select v_arrayElimArr_27 (_ bv4 32)))) (or (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_30 (_ bv4 32)))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_29 (_ bv4 32)))) (not (= (_ bv0 32) (select v_arrayElimArr_28 (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| .cse0))) (not (= (_ bv0 1) (select (store |c_#valid| .cse0 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|))) (= (_ bv1 32) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_arrayElimArr_29) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_28)) (.cse1 (store (store |c_#memory_$Pointer$#1.base| .cse0 v_arrayElimArr_30) |v_ULTIMATE.start_main_~t~0#1.base_38| v_arrayElimArr_27))) (let ((.cse2 (select (select .cse1 .cse0) (_ bv4 32))) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 .cse0) (_ bv4 32))))) (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))))))) is different from false [2025-03-08 04:33:44,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:44,534 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 162 treesize of output 143 [2025-03-08 04:33:44,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:44,549 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 132 treesize of output 113 [2025-03-08 04:33:44,556 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:33:44,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:44,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:44,582 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 360 treesize of output 332 [2025-03-08 04:33:44,595 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:33:44,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:33:44,615 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 712 treesize of output 666 [2025-03-08 04:33:44,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:44,664 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 173 treesize of output 155 [2025-03-08 04:33:44,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:44,700 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 136 treesize of output 132 [2025-03-08 04:33:44,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:44,737 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 124 treesize of output 114 [2025-03-08 04:33:44,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:33:44,788 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 89 treesize of output 89 [2025-03-08 04:33:54,126 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base| (_ bv1 1)))) (let ((.cse8 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273) v_arrayElimCell_102) (_ bv0 32)) (_ bv1 32))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|)))))) (.cse18 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse60 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse60 v_arrayElimCell_102) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse60 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1)))))))) (.cse0 (= (_ bv0 32) |c_ULTIMATE.start_main_~t~0#1.offset|)) (.cse5 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_97) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse59 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse59 v_arrayElimCell_98) v_arrayElimCell_100)) (= (_ bv1 32) (select (select .cse59 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1)))))))) (.cse22 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_98) (_ bv0 32))))))) (.cse14 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_97) v_arrayElimCell_100)))))) (.cse24 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_97) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse58 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse58 v_arrayElimCell_98) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse58 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1)))))))) (.cse15 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_97) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse57 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse57 v_arrayElimCell_97) v_arrayElimCell_100)) (= (_ bv1 32) (select (select .cse57 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1)))))))) (.cse19 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_arrayElimCell_100 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_98) v_arrayElimCell_100)))))) (.cse4 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~t~0#1.base|)))) (.cse3 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273) |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)) (_ bv1 32))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))))))) (and (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_97) (_ bv0 32)))))) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_97) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))))) (or .cse0 (and (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse2 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse2 v_arrayElimCell_98) v_arrayElimCell_100))))))) .cse3) .cse4) .cse5 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_97) v_arrayElimCell_100)) (= (_ bv1 32) (select v_ArrVal_273 (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse6 (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse6 v_arrayElimCell_102) (_ bv0 32))) (= (_ bv1 32) (select (select .cse6 v_arrayElimCell_98) v_arrayElimCell_100))))))) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse7 v_arrayElimCell_98) v_arrayElimCell_100)) (= (select (select .cse7 v_arrayElimCell_102) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse7 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))) (or (and .cse8 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse9 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse9 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_100)) (= (select (select .cse9 v_arrayElimCell_102) (_ bv0 32)) (_ bv1 32))))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|)))))) .cse4) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse10 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse10 v_arrayElimCell_97) v_arrayElimCell_100)) (= (select (select .cse10 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse10 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))) (or .cse4 (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse11 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse11 v_arrayElimCell_100)) (= (select .cse11 (_ bv0 32)) (_ bv1 32))))))) .cse3)) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse12 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse12 v_arrayElimCell_97) v_arrayElimCell_100)) (= (select (select .cse12 v_arrayElimCell_102) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse12 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))))) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse13 v_arrayElimCell_98) v_arrayElimCell_100)) (= (select (select .cse13 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse13 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))))) .cse14 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_arrayElimCell_100 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_98) v_arrayElimCell_100)) (= (_ bv1 32) (select v_ArrVal_273 (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))) .cse15 (or .cse4 (and .cse8 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse16 v_arrayElimCell_102) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse16 v_arrayElimCell_98) v_arrayElimCell_100))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse17 (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse17 v_arrayElimCell_102) (_ bv0 32))) (= (_ bv1 32) (select (select .cse17 v_arrayElimCell_97) v_arrayElimCell_100))))))) .cse18 .cse19)) (or .cse0 (and (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32))) (or (= (_ bv1 32) (select v_ArrVal_273 (_ bv0 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_98) (_ bv0 32))))))) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse20 v_arrayElimCell_98) (_ bv0 32)) (_ bv1 32)) (= (select (select .cse20 v_arrayElimCell_102) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse20 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))) (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse21 v_arrayElimCell_102) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse21 v_arrayElimCell_98) (_ bv0 32)))))))) .cse8) .cse4) .cse22 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32))) (let ((.cse23 (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse23 v_arrayElimCell_102) (_ bv0 32))) (= (_ bv1 32) (select (select .cse23 v_arrayElimCell_98) (_ bv0 32)))))))) .cse24 (or (and (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse25 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse25 v_arrayElimCell_98) (_ bv0 32)))))))) .cse3) .cse4) .cse18 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse26 v_arrayElimCell_98) (_ bv0 32)) (_ bv1 32)) (= (select (select .cse26 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))))))) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse27 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse27 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (select (select .cse27 v_arrayElimCell_97) (_ bv0 32)) (_ bv1 32))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse28 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse28 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))) (or .cse0 (and (or (and .cse8 (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse29 v_arrayElimCell_102) (_ bv0 32)) (_ bv1 32)) (= (select (select .cse29 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)) (_ bv1 32)))))))) .cse4) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse30 v_arrayElimCell_97) (_ bv0 32))) (= (_ bv1 32) (select (select .cse30 v_arrayElimCell_102) (_ bv0 32)))))))) .cse18 (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse31 v_arrayElimCell_102) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse31 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (select (select .cse31 v_arrayElimCell_97) (_ bv0 32)) (_ bv1 32))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))))) (or .cse0 (let ((.cse32 (forall ((v_arrayElimCell_104 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273) |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_104) (_ bv1 32)))))) (.cse39 (forall ((v_arrayElimCell_104 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273) v_arrayElimCell_102) v_arrayElimCell_104))))))) (and (or (and .cse32 (forall ((v_arrayElimCell_104 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse33 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_104) (_ bv1 32)) (= (_ bv1 32) (select (select .cse33 v_arrayElimCell_98) v_arrayElimCell_100))))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|)))))) .cse4) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse34 v_arrayElimCell_97) (_ bv0 32))) (= (_ bv1 32) (select (select .cse34 v_arrayElimCell_102) v_arrayElimCell_104))))))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse35 v_arrayElimCell_102) v_arrayElimCell_104) (_ bv1 32)) (= (_ bv1 32) (select (select .cse35 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (or (and .cse32 (forall ((v_arrayElimCell_104 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse36 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_104) (_ bv1 32)) (= (_ bv1 32) (select (select .cse36 v_arrayElimCell_98) (_ bv0 32))))))))) .cse4) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse37 (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse37 v_arrayElimCell_97) v_arrayElimCell_100)) (= (_ bv1 32) (select (select .cse37 v_arrayElimCell_102) v_arrayElimCell_104))))))) (or .cse4 (and (forall ((v_arrayElimCell_104 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse38 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse38 v_arrayElimCell_102) v_arrayElimCell_104)) (= (_ bv1 32) (select (select .cse38 v_arrayElimCell_98) v_arrayElimCell_100))))))) .cse39)) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse40 (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse40 v_arrayElimCell_102) v_arrayElimCell_104)) (= (_ bv1 32) (select (select .cse40 v_arrayElimCell_98) v_arrayElimCell_100))))))) .cse5 (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse41 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse41 v_arrayElimCell_97) v_arrayElimCell_100)) (= (_ bv1 32) (select (select .cse41 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_104)) (= (_ bv1 32) (select (select .cse41 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse42 v_arrayElimCell_98) (_ bv0 32)) (_ bv1 32)) (= (select (select .cse42 v_arrayElimCell_102) v_arrayElimCell_104) (_ bv1 32)) (= (_ bv1 32) (select (select .cse42 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))) .cse22 (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse43 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_104)) (= (_ bv1 32) (select (select .cse43 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (select (select .cse43 v_arrayElimCell_97) (_ bv0 32)) (_ bv1 32))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))))) (or (and (forall ((v_arrayElimCell_104 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (select .cse44 v_arrayElimCell_104) (_ bv1 32)) (= (select .cse44 (_ bv0 32)) (_ bv1 32))))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse32) .cse4) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_97) (_ bv0 32))) (= (_ bv1 32) (select v_ArrVal_273 v_arrayElimCell_104)))))) (or .cse4 (and (forall ((v_arrayElimCell_104 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse45 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse45 v_arrayElimCell_102) v_arrayElimCell_104)) (= (select (select .cse45 |c_ULTIMATE.start_main_~t~0#1.base|) (_ bv0 32)) (_ bv1 32))))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))))) .cse39)) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse46 v_arrayElimCell_98) v_arrayElimCell_100)) (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_104)) (= (_ bv1 32) (select (select .cse46 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse47 v_arrayElimCell_97) v_arrayElimCell_100)) (= (select (select .cse47 v_arrayElimCell_102) v_arrayElimCell_104) (_ bv1 32)) (= (_ bv1 32) (select (select .cse47 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))))) (or (and (forall ((v_arrayElimCell_104 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse48 v_arrayElimCell_102) v_arrayElimCell_104)) (= (_ bv1 32) (select (select .cse48 v_arrayElimCell_98) (_ bv0 32)))))))) .cse39) .cse4) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_38|) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse49 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_104)) (= (_ bv1 32) (select (select .cse49 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_arrayElimCell_100 (_ BitVec 32))) (or (= (_ bv1 32) (select v_ArrVal_273 v_arrayElimCell_104)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_98) v_arrayElimCell_100)))))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32))) (let ((.cse50 (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse50 v_arrayElimCell_102) v_arrayElimCell_104)) (= (_ bv1 32) (select (select .cse50 v_arrayElimCell_98) (_ bv0 32)))))))) .cse14 .cse24 .cse15 (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse51 v_arrayElimCell_102) v_arrayElimCell_104) (_ bv1 32)) (= (_ bv1 32) (select (select .cse51 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (select (select .cse51 v_arrayElimCell_97) (_ bv0 32)) (_ bv1 32))))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (or (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_97) v_arrayElimCell_100)) (= (_ bv1 32) (select v_ArrVal_273 v_arrayElimCell_104)))))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (select (select .cse52 v_arrayElimCell_98) (_ bv0 32)) (_ bv1 32)) (= (_ bv1 32) (select (select .cse52 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_104)) (= (_ bv1 32) (select (select .cse52 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))))))) (or (and .cse32 (forall ((v_arrayElimCell_104 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse53 (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273) |c_ULTIMATE.start_main_~t~0#1.base|))) (or (= (_ bv1 32) (select .cse53 v_arrayElimCell_100)) (= (select .cse53 v_arrayElimCell_104) (_ bv1 32)))))))) .cse4) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32)) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse54 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse54 v_arrayElimCell_98) v_arrayElimCell_100)) (= (select (select .cse54 v_arrayElimCell_102) v_arrayElimCell_104) (_ bv1 32)) (= (_ bv1 32) (select (select .cse54 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))))) (forall ((v_arrayElimCell_104 (_ BitVec 32)) (v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_98 (_ BitVec 32))) (or (= (_ bv1 32) (select v_ArrVal_273 v_arrayElimCell_104)) (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_98) (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))) (or (and (forall ((v_arrayElimCell_104 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_38|))) (forall ((v_arrayElimCell_102 (_ BitVec 32)) (v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_100 (_ BitVec 32))) (let ((.cse55 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse55 |c_ULTIMATE.start_main_~t~0#1.base|) v_arrayElimCell_100)) (= (_ bv1 32) (select (select .cse55 v_arrayElimCell_102) v_arrayElimCell_104))))))) .cse39) .cse4) .cse19))) (or .cse4 .cse3) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_38| (_ BitVec 32))) (or (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_261) v_arrayElimCell_97 v_ArrVal_267) |v_ULTIMATE.start_main_~t~0#1.base_38| v_ArrVal_273))) (or (= (_ bv1 32) (select (select .cse56 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (select (select .cse56 v_arrayElimCell_97) (_ bv0 32)) (_ bv1 32))))) (not (= (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |v_ULTIMATE.start_main_~t~0#1.base_38|) (_ bv0 1))))) (= |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimCell_97) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97))))) (forall ((v_arrayElimCell_97 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_arrayElimCell_97 (_ bv1 1)) |c_ULTIMATE.start_main_~t~0#1.base|))) (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 32) (select (select (store (store |c_#memory_int#1| v_arrayElimCell_97 v_ArrVal_267) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_273) v_arrayElimCell_97) (_ bv0 32))) (= (_ bv1 32) (select v_ArrVal_273 (_ bv0 32))))) (not (= (_ bv0 1) (select |c_#valid| v_arrayElimCell_97)))))))) is different from false