./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/running_example.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/heap-data/running_example.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 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:26:50,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:26:50,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:26:50,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:26:50,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:26:50,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:26:50,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:26:50,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:26:50,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:26:50,160 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:26:50,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:26:50,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:26:50,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:26:50,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:26:50,162 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:26:50,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:26:50,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:26:50,162 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:26:50,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:26:50,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:26:50,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:26:50,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:26:50,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:26:50,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:26:50,163 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:26:50,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:26:50,163 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:26:50,163 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:26:50,163 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:26:50,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:26:50,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:26:50,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:26:50,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:26:50,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:26:50,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:26:50,164 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:26:50,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:26:50,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:26:50,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:26:50,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:26:50,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:26:50,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:26:50,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:26:50,165 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 -> 318c7aa22aeecc0174739978e9fb15d261281003454726c8705d95a97106063f [2025-03-08 04:26:50,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:26:50,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:26:50,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:26:50,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:26:50,407 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:26:50,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/running_example.i [2025-03-08 04:26:51,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6c9eba8/e8e6f116861e4b33bd9761ba3fe32618/FLAG9683df99f [2025-03-08 04:26:51,848 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:26:51,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/running_example.i [2025-03-08 04:26:51,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6c9eba8/e8e6f116861e4b33bd9761ba3fe32618/FLAG9683df99f [2025-03-08 04:26:52,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b6c9eba8/e8e6f116861e4b33bd9761ba3fe32618 [2025-03-08 04:26:52,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:26:52,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:26:52,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:26:52,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:26:52,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:26:52,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52, skipping insertion in model container [2025-03-08 04:26:52,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:26:52,326 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/heap-data/running_example.i[23610,23623] [2025-03-08 04:26:52,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:26:52,338 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:26:52,367 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/heap-data/running_example.i[23610,23623] [2025-03-08 04:26:52,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:26:52,387 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:26:52,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52 WrapperNode [2025-03-08 04:26:52,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:26:52,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:26:52,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:26:52,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:26:52,393 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:26:52" (1/1) ... [2025-03-08 04:26:52,400 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:26:52" (1/1) ... [2025-03-08 04:26:52,410 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2025-03-08 04:26:52,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:26:52,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:26:52,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:26:52,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:26:52,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,437 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-03-08 04:26:52,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,443 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:26:52,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:26:52,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:26:52,451 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:26:52,455 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52" (1/1) ... [2025-03-08 04:26:52,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:26:52,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:52,480 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:26:52,482 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:26:52,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:26:52,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:26:52,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:26:52,587 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:26:52,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:26:52,742 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 04:26:52,743 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:26:52,752 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:26:52,752 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:26:52,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:52 BoogieIcfgContainer [2025-03-08 04:26:52,754 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:26:52,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:26:52,755 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:26:52,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:26:52,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:26:52" (1/3) ... [2025-03-08 04:26:52,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c3547b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:52, skipping insertion in model container [2025-03-08 04:26:52,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:52" (2/3) ... [2025-03-08 04:26:52,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c3547b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:52, skipping insertion in model container [2025-03-08 04:26:52,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:52" (3/3) ... [2025-03-08 04:26:52,760 INFO L128 eAbstractionObserver]: Analyzing ICFG running_example.i [2025-03-08 04:26:52,770 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:26:52,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG running_example.i that has 1 procedures, 17 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 04:26:52,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:26:52,822 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;@2e403763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:26:52,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:26:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:26:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 04:26:52,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:52,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:52,830 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:52,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 332114673, now seen corresponding path program 1 times [2025-03-08 04:26:52,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:52,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555226915] [2025-03-08 04:26:52,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:52,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:52,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:26:52,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:26:52,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:52,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:52,977 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:26:52,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:52,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555226915] [2025-03-08 04:26:52,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555226915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:52,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:52,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:26:52,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031110834] [2025-03-08 04:26:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:52,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:26:52,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:53,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:26:53,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:26:53,002 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:26:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:53,011 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2025-03-08 04:26:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:26:53,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 04:26:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:53,018 INFO L225 Difference]: With dead ends: 26 [2025-03-08 04:26:53,018 INFO L226 Difference]: Without dead ends: 14 [2025-03-08 04:26:53,021 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:26:53,023 INFO L435 NwaCegarLoop]: 19 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, 19 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:26:53,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:26:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-08 04:26:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-08 04:26:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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:26:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2025-03-08 04:26:53,048 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2025-03-08 04:26:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:53,048 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-03-08 04:26:53,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:26:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2025-03-08 04:26:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 04:26:53,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:53,049 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:53,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:26:53,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:53,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:53,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1077687532, now seen corresponding path program 1 times [2025-03-08 04:26:53,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:53,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008174973] [2025-03-08 04:26:53,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:53,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:53,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 04:26:53,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 04:26:53,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:53,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:53,262 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:26:53,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:53,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008174973] [2025-03-08 04:26:53,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008174973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:53,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:53,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:26:53,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784809428] [2025-03-08 04:26:53,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:53,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:26:53,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:53,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:26:53,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:26:53,264 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:26:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:53,335 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2025-03-08 04:26:53,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:26:53,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2025-03-08 04:26:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:53,336 INFO L225 Difference]: With dead ends: 32 [2025-03-08 04:26:53,336 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 04:26:53,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:26:53,337 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:53,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 37 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:26:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 04:26:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-08 04:26:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 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:26:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2025-03-08 04:26:53,341 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 9 [2025-03-08 04:26:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:53,341 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-03-08 04:26:53,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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:26:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2025-03-08 04:26:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 04:26:53,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:53,342 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:53,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:26:53,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:53,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash -401274952, now seen corresponding path program 1 times [2025-03-08 04:26:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:53,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908744898] [2025-03-08 04:26:53,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:53,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:26:53,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:26:53,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:53,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:53,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:53,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908744898] [2025-03-08 04:26:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908744898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:53,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927850716] [2025-03-08 04:26:53,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:53,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:53,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:53,731 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:26:53,732 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:26:53,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:26:53,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:26:53,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:53,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:53,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 04:26:53,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:53,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 15 treesize of output 1 [2025-03-08 04:26:53,882 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:26:53,974 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 39 treesize of output 22 [2025-03-08 04:26:53,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 04:26:53,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:26:53,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2025-03-08 04:26:54,048 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 15 treesize of output 7 [2025-03-08 04:26:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:54,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:54,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_89 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_17| Int) (v_ArrVal_90 (Array Int Int))) (or (< 9 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_89) |v_ULTIMATE.start_main_~p~0#1.base_17| v_ArrVal_90) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_17|) 0)) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse0 (select v_ArrVal_89 .cse0))) v_ArrVal_89)))) is different from false [2025-03-08 04:26:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 04:26:54,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927850716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:26:54,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:26:54,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-08 04:26:54,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926574733] [2025-03-08 04:26:54,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:26:54,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:26:54,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:54,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:26:54,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-03-08 04:26:54,172 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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:26:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:54,468 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2025-03-08 04:26:54,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 04:26:54,468 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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 12 [2025-03-08 04:26:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:54,469 INFO L225 Difference]: With dead ends: 77 [2025-03-08 04:26:54,469 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 04:26:54,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=290, Unknown=1, NotChecked=38, Total=462 [2025-03-08 04:26:54,470 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 107 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:54,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 103 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 102 Invalid, 0 Unknown, 80 Unchecked, 0.1s Time] [2025-03-08 04:26:54,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 04:26:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 33. [2025-03-08 04:26:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 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:26:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2025-03-08 04:26:54,478 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 12 [2025-03-08 04:26:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:54,478 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2025-03-08 04:26:54,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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:26:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2025-03-08 04:26:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 04:26:54,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:54,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:54,486 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:26:54,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:54,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:54,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1391102523, now seen corresponding path program 1 times [2025-03-08 04:26:54,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:54,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534609508] [2025-03-08 04:26:54,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:54,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:54,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:26:54,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:26:54,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:54,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:54,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534609508] [2025-03-08 04:26:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534609508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761683160] [2025-03-08 04:26:54,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:54,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:54,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:54,851 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:26:54,853 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:26:54,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:26:54,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:26:54,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:54,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:54,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 04:26:54,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:54,920 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:26:54,923 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:26:55,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 04:26:55,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 04:26:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:55,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761683160] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:26:55,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:26:55,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 04:26:55,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818273518] [2025-03-08 04:26:55,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:26:55,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 04:26:55,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:55,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 04:26:55,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:26:55,079 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:26:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:55,167 INFO L93 Difference]: Finished difference Result 74 states and 109 transitions. [2025-03-08 04:26:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:26:55,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 04:26:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:55,169 INFO L225 Difference]: With dead ends: 74 [2025-03-08 04:26:55,169 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 04:26:55,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:26:55,169 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:55,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 69 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:26:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 04:26:55,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2025-03-08 04:26:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.5) internal successors, (78), 52 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:26:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 78 transitions. [2025-03-08 04:26:55,179 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 78 transitions. Word has length 15 [2025-03-08 04:26:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:55,179 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 78 transitions. [2025-03-08 04:26:55,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:26:55,179 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 78 transitions. [2025-03-08 04:26:55,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 04:26:55,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:55,180 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:55,186 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:26:55,384 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,SelfDestructingSolverStorable3 [2025-03-08 04:26:55,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:55,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1896853868, now seen corresponding path program 2 times [2025-03-08 04:26:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:55,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590620738] [2025-03-08 04:26:55,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:26:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:55,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-08 04:26:55,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:26:55,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:26:55,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:55,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:55,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590620738] [2025-03-08 04:26:55,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590620738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:55,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299874532] [2025-03-08 04:26:55,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:26:55,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:55,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:55,707 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:26:55,709 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:26:55,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-08 04:26:55,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:26:55,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:26:55,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:55,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 04:26:55,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:55,793 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:26:55,802 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:26:55,854 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:26:55,854 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:26:55,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:26:55,863 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 04:26:55,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 04:26:55,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:26:55,913 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 21 treesize of output 11 [2025-03-08 04:26:55,920 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:26:55,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2025-03-08 04:26:55,964 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 15 treesize of output 7 [2025-03-08 04:26:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:55,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:55,997 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_239 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_29| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_29|) 0)) (< 9 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_238) |v_ULTIMATE.start_main_~p~0#1.base_29| v_ArrVal_239) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2025-03-08 04:26:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-03-08 04:26:56,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299874532] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:26:56,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:26:56,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-08 04:26:56,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658584159] [2025-03-08 04:26:56,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:26:56,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 04:26:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:56,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 04:26:56,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2025-03-08 04:26:56,099 INFO L87 Difference]: Start difference. First operand 53 states and 78 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:26:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:56,442 INFO L93 Difference]: Finished difference Result 98 states and 140 transitions. [2025-03-08 04:26:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 04:26:56,442 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 04:26:56,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:56,443 INFO L225 Difference]: With dead ends: 98 [2025-03-08 04:26:56,443 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 04:26:56,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=402, Unknown=1, NotChecked=44, Total=600 [2025-03-08 04:26:56,444 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 82 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:56,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 173 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 220 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2025-03-08 04:26:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 04:26:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2025-03-08 04:26:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.489795918367347) internal successors, (73), 49 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:26:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-03-08 04:26:56,450 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 15 [2025-03-08 04:26:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:56,450 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-03-08 04:26:56,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:26:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-03-08 04:26:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 04:26:56,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:56,451 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:56,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:26:56,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:56,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1082249081, now seen corresponding path program 1 times [2025-03-08 04:26:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:56,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733472588] [2025-03-08 04:26:56,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:56,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:56,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 04:26:56,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 04:26:56,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:56,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:56,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:56,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733472588] [2025-03-08 04:26:56,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733472588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:56,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380691795] [2025-03-08 04:26:56,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:56,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:56,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:56,795 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:26:56,797 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:26:56,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 04:26:56,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 04:26:56,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:56,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:56,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 04:26:56,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:56,861 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:26:56,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-08 04:26:56,964 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 15 treesize of output 7 [2025-03-08 04:26:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:56,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:57,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380691795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:26:57,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:26:57,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-03-08 04:26:57,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472875441] [2025-03-08 04:26:57,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:26:57,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 04:26:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:57,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 04:26:57,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-08 04:26:57,067 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:26:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:57,286 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2025-03-08 04:26:57,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 04:26:57,286 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 04:26:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:57,287 INFO L225 Difference]: With dead ends: 128 [2025-03-08 04:26:57,287 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 04:26:57,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-03-08 04:26:57,291 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:57,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 95 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:26:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 04:26:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2025-03-08 04:26:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 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:26:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2025-03-08 04:26:57,312 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 17 [2025-03-08 04:26:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:57,312 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2025-03-08 04:26:57,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:26:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2025-03-08 04:26:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 04:26:57,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:57,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:57,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 04:26:57,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:57,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:57,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:57,514 INFO L85 PathProgramCache]: Analyzing trace with hash 660560293, now seen corresponding path program 1 times [2025-03-08 04:26:57,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:57,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311108848] [2025-03-08 04:26:57,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:57,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:57,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 04:26:57,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 04:26:57,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:57,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:26:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311108848] [2025-03-08 04:26:57,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311108848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:26:57,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:26:57,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:26:57,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844288684] [2025-03-08 04:26:57,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:26:57,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:26:57,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:57,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:26:57,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:26:57,625 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:26:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:57,674 INFO L93 Difference]: Finished difference Result 135 states and 186 transitions. [2025-03-08 04:26:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:26:57,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 04:26:57,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:57,675 INFO L225 Difference]: With dead ends: 135 [2025-03-08 04:26:57,675 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 04:26:57,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:26:57,676 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:57,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 42 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:26:57,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 04:26:57,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 04:26:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 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:26:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 139 transitions. [2025-03-08 04:26:57,696 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 139 transitions. Word has length 17 [2025-03-08 04:26:57,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:57,696 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 139 transitions. [2025-03-08 04:26:57,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:26:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 139 transitions. [2025-03-08 04:26:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:26:57,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:57,698 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:57,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 04:26:57,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:57,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash 385875857, now seen corresponding path program 1 times [2025-03-08 04:26:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:57,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479180425] [2025-03-08 04:26:57,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:57,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:57,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:26:57,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:26:57,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:57,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:58,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:58,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479180425] [2025-03-08 04:26:58,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479180425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:58,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692563806] [2025-03-08 04:26:58,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:58,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:58,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:58,087 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:26:58,089 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:26:58,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:26:58,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:26:58,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:58,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:58,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 04:26:58,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:58,161 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:26:58,184 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 04:26:58,188 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 04:26:58,199 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:26:58,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 69 [2025-03-08 04:26:58,206 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 04:26:58,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-08 04:26:58,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 24 treesize of output 11 [2025-03-08 04:26:58,216 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 27 treesize of output 1 [2025-03-08 04:26:58,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 04:26:58,279 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 35 treesize of output 19 [2025-03-08 04:26:58,282 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:26:58,291 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:26:58,294 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:26:58,305 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 15 treesize of output 7 [2025-03-08 04:26:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:58,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:58,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (Array Int Int))) (< 9 (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_379) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) is different from false [2025-03-08 04:26:58,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:58,373 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 56 treesize of output 57 [2025-03-08 04:26:58,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:58,384 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 154 treesize of output 105 [2025-03-08 04:26:58,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:58,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2025-03-08 04:26:58,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:58,398 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 68 treesize of output 60 [2025-03-08 04:26:58,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:58,419 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 109 treesize of output 131 [2025-03-08 04:26:58,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:58,431 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 186 treesize of output 167 [2025-03-08 04:26:58,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2025-03-08 04:26:58,448 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 71 treesize of output 55 [2025-03-08 04:26:58,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:58,460 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 50 [2025-03-08 04:26:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-08 04:26:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692563806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:26:58,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:26:58,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 14 [2025-03-08 04:26:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672514256] [2025-03-08 04:26:58,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:26:58,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:26:58,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:26:58,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:26:58,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=119, Unknown=6, NotChecked=22, Total=182 [2025-03-08 04:26:58,711 INFO L87 Difference]: Start difference. First operand 101 states and 139 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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:26:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:26:58,945 INFO L93 Difference]: Finished difference Result 147 states and 200 transitions. [2025-03-08 04:26:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 04:26:58,949 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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:26:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:26:58,950 INFO L225 Difference]: With dead ends: 147 [2025-03-08 04:26:58,950 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 04:26:58,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=209, Unknown=6, NotChecked=30, Total=306 [2025-03-08 04:26:58,951 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 70 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:26:58,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 172 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2025-03-08 04:26:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 04:26:58,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2025-03-08 04:26:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.4206349206349207) internal successors, (179), 126 states have internal predecessors, (179), 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:26:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 179 transitions. [2025-03-08 04:26:58,960 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 179 transitions. Word has length 18 [2025-03-08 04:26:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:26:58,961 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 179 transitions. [2025-03-08 04:26:58,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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:26:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 179 transitions. [2025-03-08 04:26:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:26:58,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:26:58,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:26:58,968 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:26:59,166 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:26:59,166 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:26:59,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:26:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash 385876818, now seen corresponding path program 1 times [2025-03-08 04:26:59,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:26:59,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352221423] [2025-03-08 04:26:59,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:26:59,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:26:59,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:26:59,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:59,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:59,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:26:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352221423] [2025-03-08 04:26:59,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352221423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:26:59,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844236823] [2025-03-08 04:26:59,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:26:59,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:26:59,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:26:59,455 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:26:59,457 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:26:59,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:26:59,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:26:59,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:26:59,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:26:59,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 04:26:59,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:26:59,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 04:26:59,560 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 04:26:59,565 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 04:26:59,574 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:26:59,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 69 [2025-03-08 04:26:59,581 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 04:26:59,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-08 04:26:59,585 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 27 treesize of output 1 [2025-03-08 04:26:59,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 04:26:59,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-08 04:26:59,670 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 35 treesize of output 19 [2025-03-08 04:26:59,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 04:26:59,682 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:26:59,686 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:26:59,701 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 15 treesize of output 7 [2025-03-08 04:26:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:26:59,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:26:59,718 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_461) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))) 21)) is different from false [2025-03-08 04:26:59,731 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_461) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) 21)) is different from false [2025-03-08 04:26:59,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:59,748 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 56 treesize of output 57 [2025-03-08 04:26:59,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:59,759 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 154 treesize of output 105 [2025-03-08 04:26:59,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:59,768 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 88 treesize of output 80 [2025-03-08 04:26:59,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:59,775 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 72 treesize of output 62 [2025-03-08 04:26:59,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:59,799 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 109 treesize of output 131 [2025-03-08 04:26:59,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:59,816 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 186 treesize of output 167 [2025-03-08 04:26:59,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2025-03-08 04:26:59,830 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 71 treesize of output 55 [2025-03-08 04:26:59,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:26:59,840 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 50 [2025-03-08 04:27:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-08 04:27:00,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844236823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:27:00,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:27:00,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2025-03-08 04:27:00,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941844883] [2025-03-08 04:27:00,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:00,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:27:00,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:00,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:27:00,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=107, Unknown=2, NotChecked=42, Total=182 [2025-03-08 04:27:00,064 INFO L87 Difference]: Start difference. First operand 127 states and 179 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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:27:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:00,310 INFO L93 Difference]: Finished difference Result 214 states and 303 transitions. [2025-03-08 04:27:00,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 04:27:00,311 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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:27:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:00,312 INFO L225 Difference]: With dead ends: 214 [2025-03-08 04:27:00,312 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 04:27:00,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=188, Unknown=2, NotChecked=58, Total=306 [2025-03-08 04:27:00,312 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 78 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:00,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 212 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 141 Unchecked, 0.2s Time] [2025-03-08 04:27:00,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 04:27:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 154. [2025-03-08 04:27:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4248366013071896) internal successors, (218), 153 states have internal predecessors, (218), 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:27:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 218 transitions. [2025-03-08 04:27:00,326 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 218 transitions. Word has length 18 [2025-03-08 04:27:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:00,326 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 218 transitions. [2025-03-08 04:27:00,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 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:27:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 218 transitions. [2025-03-08 04:27:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:27:00,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:00,327 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:00,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 04:27:00,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:00,531 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:00,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:00,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1491957587, now seen corresponding path program 1 times [2025-03-08 04:27:00,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:00,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897465717] [2025-03-08 04:27:00,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:00,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:00,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:27:00,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:27:00,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:00,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:27:00,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:00,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897465717] [2025-03-08 04:27:00,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897465717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:00,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670563661] [2025-03-08 04:27:00,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:00,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:00,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:00,651 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:27:00,652 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:27:00,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:27:00,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:27:00,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:00,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:00,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 04:27:00,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:00,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-08 04:27:00,798 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 15 treesize of output 7 [2025-03-08 04:27:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:27:00,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:00,846 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-08 04:27:00,846 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 42 treesize of output 30 [2025-03-08 04:27:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:27:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670563661] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:27:00,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:27:00,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2025-03-08 04:27:00,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277583815] [2025-03-08 04:27:00,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:00,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:27:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:00,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:27:00,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:27:00,862 INFO L87 Difference]: Start difference. First operand 154 states and 218 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:27:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:01,032 INFO L93 Difference]: Finished difference Result 254 states and 357 transitions. [2025-03-08 04:27:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 04:27:01,032 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 20 [2025-03-08 04:27:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:01,033 INFO L225 Difference]: With dead ends: 254 [2025-03-08 04:27:01,033 INFO L226 Difference]: Without dead ends: 198 [2025-03-08 04:27:01,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-08 04:27:01,034 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 69 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:01,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 91 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:27:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-08 04:27:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 119. [2025-03-08 04:27:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 118 states have internal predecessors, (171), 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:27:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-03-08 04:27:01,041 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 20 [2025-03-08 04:27:01,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:01,042 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-03-08 04:27:01,042 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:27:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-03-08 04:27:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:27:01,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:01,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:01,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 04:27:01,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:01,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1060200335, now seen corresponding path program 1 times [2025-03-08 04:27:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:01,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341907536] [2025-03-08 04:27:01,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:01,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:27:01,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:27:01,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:01,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:27:01,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:01,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341907536] [2025-03-08 04:27:01,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341907536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:01,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013887822] [2025-03-08 04:27:01,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:01,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:01,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:01,389 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:27:01,391 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:27:01,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:27:01,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:27:01,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:01,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:01,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 04:27:01,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:01,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2025-03-08 04:27:01,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2025-03-08 04:27:01,566 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 15 treesize of output 7 [2025-03-08 04:27:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:27:01,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:01,695 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-08 04:27:01,695 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 132 treesize of output 104 [2025-03-08 04:27:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:27:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013887822] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:27:01,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:27:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2025-03-08 04:27:01,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120451130] [2025-03-08 04:27:01,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:01,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:27:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:01,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:27:01,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:27:01,721 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:01,880 INFO L93 Difference]: Finished difference Result 152 states and 213 transitions. [2025-03-08 04:27:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 04:27:01,880 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 04:27:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:01,881 INFO L225 Difference]: With dead ends: 152 [2025-03-08 04:27:01,881 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 04:27:01,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-08 04:27:01,882 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:01,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 95 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:27:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 04:27:01,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2025-03-08 04:27:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.4824561403508771) internal successors, (169), 114 states have internal predecessors, (169), 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:27:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2025-03-08 04:27:01,888 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 20 [2025-03-08 04:27:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:01,888 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2025-03-08 04:27:01,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2025-03-08 04:27:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:27:01,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:01,889 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:01,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 04:27:02,092 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,SelfDestructingSolverStorable10 [2025-03-08 04:27:02,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:02,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1060199374, now seen corresponding path program 1 times [2025-03-08 04:27:02,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:02,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428033401] [2025-03-08 04:27:02,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:02,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:27:02,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:27:02,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:02,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:27:02,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:02,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428033401] [2025-03-08 04:27:02,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428033401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:02,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342137267] [2025-03-08 04:27:02,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:27:02,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:02,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:02,220 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:27:02,222 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:27:02,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:27:02,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:27:02,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:27:02,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:02,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 04:27:02,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:02,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 04:27:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:27:02,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:02,563 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-08 04:27:02,564 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 33 treesize of output 25 [2025-03-08 04:27:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:27:02,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342137267] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:27:02,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:27:02,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21 [2025-03-08 04:27:02,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807508738] [2025-03-08 04:27:02,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:02,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 04:27:02,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:02,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 04:27:02,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-08 04:27:02,567 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:02,903 INFO L93 Difference]: Finished difference Result 331 states and 486 transitions. [2025-03-08 04:27:02,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 04:27:02,904 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 04:27:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:02,905 INFO L225 Difference]: With dead ends: 331 [2025-03-08 04:27:02,905 INFO L226 Difference]: Without dead ends: 276 [2025-03-08 04:27:02,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=389, Invalid=871, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 04:27:02,906 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 112 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:02,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 135 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:27:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-08 04:27:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 212. [2025-03-08 04:27:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.4739336492890995) internal successors, (311), 211 states have internal predecessors, (311), 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:27:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 311 transitions. [2025-03-08 04:27:02,917 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 311 transitions. Word has length 20 [2025-03-08 04:27:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:02,917 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 311 transitions. [2025-03-08 04:27:02,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:27:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 311 transitions. [2025-03-08 04:27:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 04:27:02,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:02,918 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:02,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 04:27:03,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:03,119 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:03,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:03,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1418096059, now seen corresponding path program 2 times [2025-03-08 04:27:03,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:03,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267856634] [2025-03-08 04:27:03,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:27:03,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:03,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-08 04:27:03,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:27:03,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:27:03,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:03,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:03,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267856634] [2025-03-08 04:27:03,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267856634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:03,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974949184] [2025-03-08 04:27:03,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:27:03,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:03,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:03,520 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:27:03,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 04:27:03,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-08 04:27:03,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:27:03,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:27:03,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:03,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 04:27:03,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:03,630 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:27:03,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 04:27:03,675 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 04:27:03,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-08 04:27:03,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 5 treesize of output 3 [2025-03-08 04:27:03,682 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 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 04:27:03,694 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 04:27:03,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2025-03-08 04:27:03,701 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 19 treesize of output 1 [2025-03-08 04:27:03,705 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 15 treesize of output 11 [2025-03-08 04:27:03,724 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:27:03,725 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:27:03,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:03,805 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-03-08 04:27:03,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 106 [2025-03-08 04:27:03,811 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2025-03-08 04:27:03,815 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 67 treesize of output 34 [2025-03-08 04:27:03,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:03,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2025-03-08 04:27:03,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:03,823 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:27:03,831 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:27:03,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-03-08 04:27:03,893 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 39 treesize of output 23 [2025-03-08 04:27:03,896 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:27:03,906 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 31 treesize of output 19 [2025-03-08 04:27:03,912 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:27:03,914 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:27:03,927 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 15 treesize of output 7 [2025-03-08 04:27:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:03,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:03,961 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int))) (< 9 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_810) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2025-03-08 04:27:03,972 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int))) (< 9 (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_810) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) is different from false [2025-03-08 04:27:03,987 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_70| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_807 Int) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_70|) 0)) (< 9 (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_803) |v_ULTIMATE.start_main_~p~0#1.base_70| v_ArrVal_800) |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_810) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_802) |v_ULTIMATE.start_main_~p~0#1.base_70| v_ArrVal_806) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 v_ArrVal_807)) |v_ULTIMATE.start_main_~p~0#1.base_70| v_ArrVal_804) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 (select v_ArrVal_803 .cse1)) v_ArrVal_803))))) is different from false [2025-03-08 04:27:04,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:04,021 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 66 [2025-03-08 04:27:04,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:04,032 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 647 treesize of output 484 [2025-03-08 04:27:04,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:04,040 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 214 treesize of output 184 [2025-03-08 04:27:04,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:04,050 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 174 treesize of output 162 [2025-03-08 04:27:04,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:04,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2504 treesize of output 2524 [2025-03-08 04:27:04,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:04,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5200 treesize of output 4803 [2025-03-08 04:27:04,186 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 364 treesize of output 296 [2025-03-08 04:27:04,200 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 267 treesize of output 235 [2025-03-08 04:27:04,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:04,228 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 646 treesize of output 614 [2025-03-08 04:27:04,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:04,289 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 614 treesize of output 614 [2025-03-08 04:27:04,309 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 403 treesize of output 371 [2025-03-08 04:27:04,333 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 375 treesize of output 251 [2025-03-08 04:27:04,839 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:27:05,212 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:27:06,283 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:06,286 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 129 treesize of output 125 [2025-03-08 04:27:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2025-03-08 04:27:06,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974949184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:27:06,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:27:06,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2025-03-08 04:27:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643021385] [2025-03-08 04:27:06,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:06,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 04:27:06,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:06,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 04:27:06,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=204, Unknown=3, NotChecked=90, Total=342 [2025-03-08 04:27:06,403 INFO L87 Difference]: Start difference. First operand 212 states and 311 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 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:27:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:06,788 INFO L93 Difference]: Finished difference Result 284 states and 410 transitions. [2025-03-08 04:27:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 04:27:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 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:27:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:06,790 INFO L225 Difference]: With dead ends: 284 [2025-03-08 04:27:06,790 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 04:27:06,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=525, Unknown=3, NotChecked=150, Total=812 [2025-03-08 04:27:06,791 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 115 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:06,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 213 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 252 Invalid, 0 Unknown, 285 Unchecked, 0.2s Time] [2025-03-08 04:27:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 04:27:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 225. [2025-03-08 04:27:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4732142857142858) internal successors, (330), 224 states have internal predecessors, (330), 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:27:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 330 transitions. [2025-03-08 04:27:06,803 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 330 transitions. Word has length 21 [2025-03-08 04:27:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:06,803 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 330 transitions. [2025-03-08 04:27:06,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 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:27:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 330 transitions. [2025-03-08 04:27:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 04:27:06,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:06,804 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:06,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 04:27:07,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 04:27:07,005 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:07,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:07,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1418095098, now seen corresponding path program 2 times [2025-03-08 04:27:07,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:07,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469945819] [2025-03-08 04:27:07,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:27:07,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:07,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-08 04:27:07,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:27:07,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:27:07,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:07,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:07,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469945819] [2025-03-08 04:27:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469945819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737949044] [2025-03-08 04:27:07,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:27:07,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:07,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:07,481 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:27:07,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 04:27:07,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-08 04:27:07,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:27:07,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:27:07,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:07,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 04:27:07,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:07,601 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:27:07,631 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:27:07,631 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:27:07,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 04:27:07,641 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 50 treesize of output 39 [2025-03-08 04:27:07,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-08 04:27:07,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 04:27:07,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 04:27:07,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:07,719 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-03-08 04:27:07,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 85 [2025-03-08 04:27:07,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:07,726 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 44 treesize of output 24 [2025-03-08 04:27:07,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:27:07,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2025-03-08 04:27:07,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-03-08 04:27:07,744 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:27:07,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-03-08 04:27:07,802 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 39 treesize of output 23 [2025-03-08 04:27:07,807 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:27:07,810 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 31 treesize of output 19 [2025-03-08 04:27:07,819 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:27:07,821 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:27:07,836 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 15 treesize of output 7 [2025-03-08 04:27:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:07,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:07,871 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_935 (Array Int Int))) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_935) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))) 21)) is different from false [2025-03-08 04:27:07,880 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_935 (Array Int Int))) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_935) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) 21)) is different from false [2025-03-08 04:27:07,895 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (v_ArrVal_935 (Array Int Int)) (v_ArrVal_934 (Array Int Int)) (v_ArrVal_929 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_80| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_80|) 0)) (< (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_933) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_929) |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_935) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_930) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_931) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_934) |v_ULTIMATE.start_main_~p~0#1.base_80| v_ArrVal_932) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) 21) (not (= v_ArrVal_933 (let ((.cse1 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~tail~0#1.base|) .cse1 (select v_ArrVal_933 .cse1))))))) is different from false [2025-03-08 04:27:07,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:07,925 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 60 treesize of output 61 [2025-03-08 04:27:07,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:07,938 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 607 treesize of output 444 [2025-03-08 04:27:07,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:07,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 164 [2025-03-08 04:27:07,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:07,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7080 treesize of output 7004 [2025-03-08 04:27:08,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:08,016 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 5200 treesize of output 4803 [2025-03-08 04:27:08,056 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 364 treesize of output 296 [2025-03-08 04:27:08,069 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 267 treesize of output 235 [2025-03-08 04:27:08,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:08,132 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 678 treesize of output 646 [2025-03-08 04:27:08,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:08,161 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 614 treesize of output 614 [2025-03-08 04:27:08,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 391 treesize of output 267 [2025-03-08 04:27:08,200 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 291 treesize of output 259 [2025-03-08 04:27:08,450 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:27:08,753 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:27:10,400 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:27:10,403 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 71 treesize of output 69 [2025-03-08 04:27:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-03-08 04:27:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737949044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:27:10,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:27:10,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2025-03-08 04:27:10,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121036760] [2025-03-08 04:27:10,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:27:10,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 04:27:10,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:27:10,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 04:27:10,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=181, Unknown=3, NotChecked=84, Total=306 [2025-03-08 04:27:10,508 INFO L87 Difference]: Start difference. First operand 225 states and 330 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:27:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:27:10,965 INFO L93 Difference]: Finished difference Result 442 states and 649 transitions. [2025-03-08 04:27:10,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 04:27:10,965 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:27:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:27:10,966 INFO L225 Difference]: With dead ends: 442 [2025-03-08 04:27:10,966 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 04:27:10,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=570, Unknown=3, NotChecked=156, Total=870 [2025-03-08 04:27:10,967 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 107 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:27:10,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 231 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 287 Invalid, 0 Unknown, 255 Unchecked, 0.2s Time] [2025-03-08 04:27:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 04:27:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 215. [2025-03-08 04:27:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4766355140186915) internal successors, (316), 214 states have internal predecessors, (316), 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:27:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 316 transitions. [2025-03-08 04:27:10,978 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 316 transitions. Word has length 21 [2025-03-08 04:27:10,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:27:10,978 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 316 transitions. [2025-03-08 04:27:10,979 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:27:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 316 transitions. [2025-03-08 04:27:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 04:27:10,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:27:10,979 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:27:10,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 04:27:11,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 04:27:11,183 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:27:11,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:27:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash -390205270, now seen corresponding path program 3 times [2025-03-08 04:27:11,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:27:11,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694379294] [2025-03-08 04:27:11,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:27:11,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:27:11,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-08 04:27:11,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 04:27:11,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:27:11,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:27:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694379294] [2025-03-08 04:27:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694379294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:27:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421247339] [2025-03-08 04:27:11,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:27:11,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:27:11,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:27:11,510 INFO L229 MonitoredProcess]: Starting monitored process 13 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:27:11,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 04:27:11,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-08 04:27:11,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 04:27:11,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:27:11,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:27:11,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 04:27:11,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:27:11,622 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:27:11,645 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 04:27:11,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-08 04:27:11,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 19 [2025-03-08 04:27:11,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 11 [2025-03-08 04:27:11,725 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 04:27:11,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2025-03-08 04:27:11,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-08 04:27:11,828 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 04:27:11,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 35 [2025-03-08 04:27:11,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-08 04:27:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:27:11,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:27:11,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse2 (+ (select .cse3 .cse1) 4))) (and (forall ((v_ArrVal_1034 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_main_~p~0#1.offset| (select v_ArrVal_1034 |c_ULTIMATE.start_main_~p~0#1.offset|)) v_ArrVal_1034)) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1034) (select v_ArrVal_1034 .cse1)) .cse2) 0))) (forall ((v_ArrVal_1032 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~p~0#1.offset| v_ArrVal_1032)) (select .cse0 .cse1)) .cse2) 0))))) is different from false [2025-03-08 04:27:11,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse1 (+ (select .cse3 .cse0) 4))) (and (forall ((v_ArrVal_1034 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1034) (select v_ArrVal_1034 .cse0)) .cse1) 0) (not (= v_ArrVal_1034 (store .cse2 |c_ULTIMATE.start_main_~list~0#1.offset| (select v_ArrVal_1034 |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (forall ((v_ArrVal_1032 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_1032)) (select .cse2 .cse0)) .cse1) 0))))) is different from false [2025-03-08 04:27:12,096 INFO L349 Elim1Store]: treesize reduction 131, result has 40.2 percent of original size [2025-03-08 04:27:12,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 4470 treesize of output 4472 [2025-03-08 04:27:13,431 INFO L349 Elim1Store]: treesize reduction 542, result has 55.8 percent of original size [2025-03-08 04:27:13,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 1 disjoint index pairs (out of 105 index pairs), introduced 18 new quantified variables, introduced 104 case distinctions, treesize of input 100787 treesize of output 88552 [2025-03-08 04:27:14,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:27:14,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2947 treesize of output 2975